/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:48:07,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:48:07,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:48:07,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:48:07,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:48:07,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:48:07,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:48:07,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:48:07,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:48:07,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:48:07,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:48:07,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:48:07,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:48:07,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:48:07,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:48:07,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:48:07,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:48:07,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:48:07,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:48:07,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:48:07,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:48:07,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:48:07,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:48:07,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:48:07,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:48:07,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:48:07,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:48:07,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:48:07,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:48:07,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:48:07,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:48:07,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:48:07,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:48:07,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:48:07,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:48:07,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:48:07,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:48:07,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:48:07,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:48:07,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:48:07,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:48:07,189 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:48:07,203 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:48:07,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:48:07,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:48:07,204 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:48:07,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:48:07,205 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:07,205 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:48:07,205 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:48:07,205 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:48:07,205 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:48:07,206 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:48:07,206 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:48:07,206 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:48:07,206 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:48:07,206 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:48:07,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:48:07,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:48:07,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:48:07,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:48:07,207 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:48:07,207 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:48:07,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:48:07,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:48:07,208 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:48:07,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:07,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:48:07,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:48:07,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:48:07,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:48:07,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:48:07,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:48:07,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:48:07,393 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:48:07,394 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:48:07,394 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:07,465 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_zJQ3ii/tmp/b78e1a47992c4a6da3e492d9df0cac73/FLAGf4d4327a7 [2020-07-01 12:48:07,819 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:48:07,819 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:07,820 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:48:07,827 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_zJQ3ii/tmp/b78e1a47992c4a6da3e492d9df0cac73/FLAGf4d4327a7 [2020-07-01 12:48:08,237 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_zJQ3ii/tmp/b78e1a47992c4a6da3e492d9df0cac73 [2020-07-01 12:48:08,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:48:08,250 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:48:08,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:08,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:48:08,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:48:08,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c716af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08, skipping insertion in model container [2020-07-01 12:48:08,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:48:08,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:48:08,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,525 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:48:08,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,560 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:48:08,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08 WrapperNode [2020-07-01 12:48:08,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:08,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:48:08,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:48:08,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:48:08,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:48:08,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:48:08,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:48:08,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:48:08,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:08,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:48:08,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:48:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:48:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:48:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:48:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:48:08,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:48:08,995 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:48:08,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08 BoogieIcfgContainer [2020-07-01 12:48:08,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:48:09,000 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:48:09,000 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:48:09,002 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:48:09,003 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:09,022 INFO L313 BlockEncoder]: Initial Icfg 39 locations, 44 edges [2020-07-01 12:48:09,023 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:48:09,024 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:48:09,025 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:48:09,025 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:09,027 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:48:09,028 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:48:09,028 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:48:09,053 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:48:09,083 INFO L200 BlockEncoder]: SBE split 18 edges [2020-07-01 12:48:09,088 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:48:09,090 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:09,116 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:48:09,118 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 12:48:09,120 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:48:09,120 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:09,121 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:48:09,121 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:48:09,121 INFO L313 BlockEncoder]: Encoded RCFG 29 locations, 53 edges [2020-07-01 12:48:09,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09 BasicIcfg [2020-07-01 12:48:09,122 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:48:09,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:48:09,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:48:09,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:48:09,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:48:08" (1/4) ... [2020-07-01 12:48:09,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f06d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/4) ... [2020-07-01 12:48:09,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f06d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (3/4) ... [2020-07-01 12:48:09,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f06d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09" (4/4) ... [2020-07-01 12:48:09,131 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:09,141 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:48:09,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 12:48:09,163 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 12:48:09,186 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:48:09,186 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:48:09,187 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:09,187 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:09,187 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:09,187 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:48:09,187 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:09,187 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:48:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-01 12:48:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:09,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:09,210 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 193728502, now seen corresponding path program 1 times [2020-07-01 12:48:09,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032901237] [2020-07-01 12:48:09,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032901237] [2020-07-01 12:48:09,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067004784] [2020-07-01 12:48:09,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,409 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-01 12:48:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,524 INFO L93 Difference]: Finished difference Result 54 states and 97 transitions. [2020-07-01 12:48:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,539 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:48:09,539 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:48:09,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:48:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:48:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:48:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2020-07-01 12:48:09,582 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 50 transitions. Word has length 5 [2020-07-01 12:48:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,583 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 50 transitions. [2020-07-01 12:48:09,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 50 transitions. [2020-07-01 12:48:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:09,583 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:09,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:48:09,586 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 193728533, now seen corresponding path program 1 times [2020-07-01 12:48:09,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610805651] [2020-07-01 12:48:09,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610805651] [2020-07-01 12:48:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708249800] [2020-07-01 12:48:09,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,639 INFO L87 Difference]: Start difference. First operand 29 states and 50 transitions. Second operand 3 states. [2020-07-01 12:48:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,720 INFO L93 Difference]: Finished difference Result 29 states and 50 transitions. [2020-07-01 12:48:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,721 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:48:09,721 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:48:09,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:48:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:48:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2020-07-01 12:48:09,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 5 [2020-07-01 12:48:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,728 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-07-01 12:48:09,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2020-07-01 12:48:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:09,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:09,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:48:09,729 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,729 INFO L82 PathProgramCache]: Analyzing trace with hash 193728535, now seen corresponding path program 1 times [2020-07-01 12:48:09,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189951935] [2020-07-01 12:48:09,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189951935] [2020-07-01 12:48:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882001187] [2020-07-01 12:48:09,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,767 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand 3 states. [2020-07-01 12:48:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,835 INFO L93 Difference]: Finished difference Result 29 states and 48 transitions. [2020-07-01 12:48:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,836 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:48:09,836 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:48:09,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:48:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:48:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2020-07-01 12:48:09,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 5 [2020-07-01 12:48:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,842 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. [2020-07-01 12:48:09,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2020-07-01 12:48:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:09,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:09,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:48:09,843 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash 193728536, now seen corresponding path program 1 times [2020-07-01 12:48:09,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433259419] [2020-07-01 12:48:09,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433259419] [2020-07-01 12:48:09,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:09,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520847189] [2020-07-01 12:48:09,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:09,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:09,887 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. [2020-07-01 12:48:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,960 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 12:48:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:09,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:48:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,962 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:48:09,962 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:48:09,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:48:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:48:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:48:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-07-01 12:48:09,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 5 [2020-07-01 12:48:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,966 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-07-01 12:48:09,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-07-01 12:48:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:48:09,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:09,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:48:09,968 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1710615914, now seen corresponding path program 1 times [2020-07-01 12:48:09,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662516955] [2020-07-01 12:48:09,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662516955] [2020-07-01 12:48:09,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580048020] [2020-07-01 12:48:09,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,998 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-07-01 12:48:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,067 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-07-01 12:48:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:48:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,069 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:48:10,069 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:48:10,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:48:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:48:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:48:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. [2020-07-01 12:48:10,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 44 transitions. Word has length 6 [2020-07-01 12:48:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,075 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 44 transitions. [2020-07-01 12:48:10,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 44 transitions. [2020-07-01 12:48:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:48:10,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:48:10,076 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1710615916, now seen corresponding path program 1 times [2020-07-01 12:48:10,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436029285] [2020-07-01 12:48:10,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436029285] [2020-07-01 12:48:10,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:10,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202750937] [2020-07-01 12:48:10,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:10,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:10,120 INFO L87 Difference]: Start difference. First operand 26 states and 44 transitions. Second operand 4 states. [2020-07-01 12:48:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,199 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2020-07-01 12:48:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:10,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:48:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,201 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:48:10,201 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:48:10,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:48:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:48:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:48:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2020-07-01 12:48:10,206 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 6 [2020-07-01 12:48:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,206 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-07-01 12:48:10,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2020-07-01 12:48:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:48:10,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:48:10,207 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1710615917, now seen corresponding path program 1 times [2020-07-01 12:48:10,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952417279] [2020-07-01 12:48:10,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952417279] [2020-07-01 12:48:10,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911559447] [2020-07-01 12:48:10,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,244 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 3 states. [2020-07-01 12:48:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,312 INFO L93 Difference]: Finished difference Result 26 states and 43 transitions. [2020-07-01 12:48:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:48:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,314 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:48:10,314 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:48:10,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:48:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:48:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:48:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2020-07-01 12:48:10,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 6 [2020-07-01 12:48:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,320 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2020-07-01 12:48:10,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2020-07-01 12:48:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:48:10,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:48:10,321 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1489486953, now seen corresponding path program 1 times [2020-07-01 12:48:10,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649904291] [2020-07-01 12:48:10,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649904291] [2020-07-01 12:48:10,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:10,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521973384] [2020-07-01 12:48:10,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:10,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:10,360 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand 4 states. [2020-07-01 12:48:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,424 INFO L93 Difference]: Finished difference Result 25 states and 42 transitions. [2020-07-01 12:48:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:10,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:48:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,425 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:48:10,425 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:48:10,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:48:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:48:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:48:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:48:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-07-01 12:48:10,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 7 [2020-07-01 12:48:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,430 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-07-01 12:48:10,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. [2020-07-01 12:48:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:48:10,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:48:10,431 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1489486955, now seen corresponding path program 1 times [2020-07-01 12:48:10,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343334798] [2020-07-01 12:48:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343334798] [2020-07-01 12:48:10,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:10,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004063892] [2020-07-01 12:48:10,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:10,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:48:10,468 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 4 states. [2020-07-01 12:48:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,559 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2020-07-01 12:48:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:10,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:48:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,561 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:48:10,561 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:48:10,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:48:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:48:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-01 12:48:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:48:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-07-01 12:48:10,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 7 [2020-07-01 12:48:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,568 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-07-01 12:48:10,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-07-01 12:48:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:48:10,569 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:48:10,569 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1489486956, now seen corresponding path program 1 times [2020-07-01 12:48:10,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409609714] [2020-07-01 12:48:10,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409609714] [2020-07-01 12:48:10,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:48:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25809423] [2020-07-01 12:48:10,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:48:10,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:48:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:10,641 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 6 states. [2020-07-01 12:48:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,782 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2020-07-01 12:48:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:48:10,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:48:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,784 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:48:10,784 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:48:10,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:48:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:48:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-01 12:48:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:48:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2020-07-01 12:48:10,788 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 7 [2020-07-01 12:48:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,789 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. [2020-07-01 12:48:10,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:48:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. [2020-07-01 12:48:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:48:10,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:48:10,790 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1770628754, now seen corresponding path program 1 times [2020-07-01 12:48:10,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736341786] [2020-07-01 12:48:10,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736341786] [2020-07-01 12:48:10,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104547130] [2020-07-01 12:48:10,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,827 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. [2020-07-01 12:48:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,866 INFO L93 Difference]: Finished difference Result 30 states and 54 transitions. [2020-07-01 12:48:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:48:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,867 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:48:10,867 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:48:10,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:48:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:48:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2020-07-01 12:48:10,872 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 11 [2020-07-01 12:48:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,872 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-07-01 12:48:10,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2020-07-01 12:48:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:48:10,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:48:10,873 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1770628756, now seen corresponding path program 1 times [2020-07-01 12:48:10,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131066455] [2020-07-01 12:48:10,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131066455] [2020-07-01 12:48:10,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:48:10,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139516383] [2020-07-01 12:48:10,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:48:10,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:48:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:48:10,925 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand 5 states. [2020-07-01 12:48:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:11,025 INFO L93 Difference]: Finished difference Result 31 states and 50 transitions. [2020-07-01 12:48:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:48:11,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:48:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:11,026 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:48:11,026 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:48:11,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:48:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:48:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:48:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2020-07-01 12:48:11,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 11 [2020-07-01 12:48:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:11,031 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2020-07-01 12:48:11,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:48:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2020-07-01 12:48:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:48:11,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:11,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:11,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:48:11,032 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1770629016, now seen corresponding path program 1 times [2020-07-01 12:48:11,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:11,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881272349] [2020-07-01 12:48:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:11,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881272349] [2020-07-01 12:48:11,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:11,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032099970] [2020-07-01 12:48:11,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:11,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:11,058 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 3 states. [2020-07-01 12:48:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:11,098 INFO L93 Difference]: Finished difference Result 46 states and 76 transitions. [2020-07-01 12:48:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:11,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:48:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:11,100 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:48:11,100 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:48:11,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:48:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-01 12:48:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:48:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2020-07-01 12:48:11,104 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 11 [2020-07-01 12:48:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:11,104 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2020-07-01 12:48:11,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2020-07-01 12:48:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:48:11,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:11,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:11,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:48:11,105 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1770688598, now seen corresponding path program 1 times [2020-07-01 12:48:11,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:11,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052941319] [2020-07-01 12:48:11,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:11,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052941319] [2020-07-01 12:48:11,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:11,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:11,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220562165] [2020-07-01 12:48:11,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:11,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:11,136 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 3 states. [2020-07-01 12:48:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:11,176 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2020-07-01 12:48:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:11,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:48:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:11,177 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:48:11,177 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:48:11,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:48:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:48:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-01 12:48:11,181 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 11 [2020-07-01 12:48:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:11,181 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-01 12:48:11,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-01 12:48:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:48:11,182 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:11,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:11,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:48:11,182 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:11,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1988916226, now seen corresponding path program 1 times [2020-07-01 12:48:11,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:11,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940799042] [2020-07-01 12:48:11,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:11,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940799042] [2020-07-01 12:48:11,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799659022] [2020-07-01 12:48:11,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:11,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:48:11,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:11,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:48:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:48:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919517739] [2020-07-01 12:48:11,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:11,322 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 4 states. [2020-07-01 12:48:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:11,387 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-01 12:48:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:11,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-01 12:48:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:11,388 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:48:11,388 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:48:11,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:48:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-01 12:48:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-07-01 12:48:11,392 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2020-07-01 12:48:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:11,392 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-01 12:48:11,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-01 12:48:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:48:11,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:11,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:11,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 12:48:11,594 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1988916225, now seen corresponding path program 1 times [2020-07-01 12:48:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:11,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087166922] [2020-07-01 12:48:11,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:11,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087166922] [2020-07-01 12:48:11,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:11,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:48:11,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397906229] [2020-07-01 12:48:11,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:48:11,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:48:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:48:11,717 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 7 states. [2020-07-01 12:48:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:11,860 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2020-07-01 12:48:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:48:11,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-01 12:48:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:11,861 INFO L225 Difference]: With dead ends: 55 [2020-07-01 12:48:11,861 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:48:11,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:48:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:48:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-01 12:48:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 12:48:11,865 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2020-07-01 12:48:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:11,865 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:48:11,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:48:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 12:48:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:48:11,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:11,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:11,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:48:11,866 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 920283425, now seen corresponding path program 1 times [2020-07-01 12:48:11,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:11,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704264665] [2020-07-01 12:48:11,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:12,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704264665] [2020-07-01 12:48:12,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356509185] [2020-07-01 12:48:12,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:12,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 12:48:12,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:12,087 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_34|]} [2020-07-01 12:48:12,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:48:12,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:48:12,109 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,120 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:48:12,132 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,141 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,141 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:48:12,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:48:12,175 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,185 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,186 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,186 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:48:12,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:48:12,236 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,250 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,252 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:12,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:48:12,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:48:12,311 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:12,314 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:48:12,326 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:12,328 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:12,330 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:12,330 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:34 [2020-07-01 12:48:12,380 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:12,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:12,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:48:12,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074071] [2020-07-01 12:48:12,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:48:12,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:12,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:48:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:48:12,440 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 15 states. [2020-07-01 12:48:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:13,200 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2020-07-01 12:48:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:48:13,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2020-07-01 12:48:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:13,202 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:48:13,202 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:48:13,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-07-01 12:48:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:48:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2020-07-01 12:48:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:48:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 12:48:13,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2020-07-01 12:48:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:13,206 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:48:13,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:48:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 12:48:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:48:13,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:13,208 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:13,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:48:13,409 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -6231863, now seen corresponding path program 1 times [2020-07-01 12:48:13,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:13,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053959218] [2020-07-01 12:48:13,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:13,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053959218] [2020-07-01 12:48:13,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200840185] [2020-07-01 12:48:13,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:13,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 12:48:13,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:13,642 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:13,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:48:13,653 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:13,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:48:13,657 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:13,672 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:13,675 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:48:13,675 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:48:13,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:13,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-07-01 12:48:13,831 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:13,832 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:13,833 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:13,834 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:13,835 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-01 12:48:13,836 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:13,838 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 12:48:13,918 INFO L619 ElimStorePlain]: treesize reduction 15, result has 86.6 percent of original size [2020-07-01 12:48:13,921 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:13,922 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:13,923 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:13,924 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:13,926 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:48:13,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:57 [2020-07-01 12:48:13,972 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:13,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:13,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:48:13,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126575109] [2020-07-01 12:48:13,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:48:13,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:48:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:48:13,995 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 17 states. [2020-07-01 12:48:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:14,902 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-01 12:48:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 12:48:14,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-07-01 12:48:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:14,903 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:48:14,904 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:48:14,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:48:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:48:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2020-07-01 12:48:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:48:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-07-01 12:48:14,909 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 18 [2020-07-01 12:48:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:14,909 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-01 12:48:14,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:48:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-01 12:48:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:48:14,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:14,910 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:15,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 12:48:15,111 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -6231862, now seen corresponding path program 1 times [2020-07-01 12:48:15,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:15,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999582617] [2020-07-01 12:48:15,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:15,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999582617] [2020-07-01 12:48:15,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293142027] [2020-07-01 12:48:15,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:15,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:48:15,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:15,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:48:15,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:48:15,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150626871] [2020-07-01 12:48:15,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:48:15,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:48:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:15,222 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 4 states. [2020-07-01 12:48:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:15,268 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-01 12:48:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:48:15,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-01 12:48:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:15,270 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:48:15,270 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:48:15,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:48:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:48:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:48:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:48:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-01 12:48:15,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2020-07-01 12:48:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:15,275 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-01 12:48:15,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:48:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-01 12:48:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 12:48:15,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:15,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:15,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:15,477 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash -971693654, now seen corresponding path program 2 times [2020-07-01 12:48:15,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:15,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615750492] [2020-07-01 12:48:15,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:15,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615750492] [2020-07-01 12:48:15,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697635289] [2020-07-01 12:48:15,704 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:15,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:48:15,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:48:15,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 12:48:15,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:15,776 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_35|]} [2020-07-01 12:48:15,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:48:15,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:48:15,783 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:15,792 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:15,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:48:15,802 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:15,811 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:15,811 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:15,811 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:48:15,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:48:15,852 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:15,862 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:15,863 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:15,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:48:15,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:48:15,907 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:15,919 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:15,921 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:15,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:48:16,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:16,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:48:16,005 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:16,006 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:48:16,021 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:16,022 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:16,023 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:16,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-07-01 12:48:16,059 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:48:16,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:16,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 12:48:16,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292932039] [2020-07-01 12:48:16,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:48:16,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:48:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:48:16,078 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 13 states. [2020-07-01 12:48:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:17,107 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-01 12:48:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:48:17,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-07-01 12:48:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:17,108 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:48:17,108 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:48:17,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:48:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:48:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2020-07-01 12:48:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:48:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-01 12:48:17,114 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 21 [2020-07-01 12:48:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:17,114 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-01 12:48:17,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:48:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-01 12:48:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-01 12:48:17,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:17,115 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:17,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:17,316 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1974848302, now seen corresponding path program 2 times [2020-07-01 12:48:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:17,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698886597] [2020-07-01 12:48:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:17,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698886597] [2020-07-01 12:48:17,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235628659] [2020-07-01 12:48:17,654 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:17,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:48:17,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:48:17,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-01 12:48:17,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:17,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:17,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:48:17,716 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:17,735 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:48:17,736 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:17,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:48:17,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:48:17,767 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:17,773 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:17,774 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:17,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:48:17,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:17,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2020-07-01 12:48:17,925 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:17,926 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:48:17,927 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-01 12:48:17,928 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:17,928 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:17,929 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:17,930 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:17,931 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:17,933 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:48:18,066 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-07-01 12:48:18,067 INFO L619 ElimStorePlain]: treesize reduction 13, result has 92.8 percent of original size [2020-07-01 12:48:18,069 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:18,070 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:18,071 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:18,072 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:18,073 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:18,074 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:18,074 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:47 [2020-07-01 12:48:18,133 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:48:18,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:18,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-01 12:48:18,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545366537] [2020-07-01 12:48:18,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:48:18,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:18,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:48:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:48:18,166 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 18 states. [2020-07-01 12:48:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:20,241 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-01 12:48:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-01 12:48:20,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2020-07-01 12:48:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:20,242 INFO L225 Difference]: With dead ends: 72 [2020-07-01 12:48:20,243 INFO L226 Difference]: Without dead ends: 66 [2020-07-01 12:48:20,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=645, Invalid=1905, Unknown=0, NotChecked=0, Total=2550 [2020-07-01 12:48:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-01 12:48:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2020-07-01 12:48:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:48:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-01 12:48:20,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 25 [2020-07-01 12:48:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:20,248 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-01 12:48:20,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:48:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-01 12:48:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-01 12:48:20,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:20,250 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:20,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:20,450 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 641902658, now seen corresponding path program 1 times [2020-07-01 12:48:20,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:20,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005268650] [2020-07-01 12:48:20,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:48:20,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005268650] [2020-07-01 12:48:20,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442000293] [2020-07-01 12:48:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:20,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 12:48:20,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:20,654 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_36|]} [2020-07-01 12:48:20,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:48:20,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:48:20,658 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,665 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:48:20,669 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,675 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,676 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,676 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:48:20,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:48:20,694 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,700 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,701 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 12:48:20,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 12:48:20,722 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,729 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,730 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:20,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 12:48:20,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 12:48:20,784 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:20,785 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:48:20,794 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:20,794 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:20,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 12:48:20,816 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:48:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 12:48:20,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066781780] [2020-07-01 12:48:20,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:48:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:48:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:48:20,840 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 13 states. [2020-07-01 12:48:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:21,129 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2020-07-01 12:48:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:48:21,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2020-07-01 12:48:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:21,131 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:48:21,131 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:48:21,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:48:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:48:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:48:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:48:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2020-07-01 12:48:21,136 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2020-07-01 12:48:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:21,137 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-01 12:48:21,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:48:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-01 12:48:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-01 12:48:21,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:21,138 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:21,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:21,339 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1956818794, now seen corresponding path program 1 times [2020-07-01 12:48:21,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:21,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138181578] [2020-07-01 12:48:21,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:48:21,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138181578] [2020-07-01 12:48:21,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710485994] [2020-07-01 12:48:21,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:48:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:21,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 12:48:21,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:48:21,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:21,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:48:21,571 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:21,588 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:48:21,589 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:21,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:48:21,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:48:21,609 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:48:21,614 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:21,615 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:48:21,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:48:21,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:48:21,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 53 [2020-07-01 12:48:21,704 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:48:21,705 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:48:21,706 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-01 12:48:21,706 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:21,707 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:21,708 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:21,708 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:48:21,709 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:48:21,710 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:48:21,803 INFO L619 ElimStorePlain]: treesize reduction 11, result has 92.9 percent of original size [2020-07-01 12:48:21,804 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:21,805 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:21,806 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:48:21,806 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2020-07-01 12:48:21,848 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:48:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:48:21,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:48:21,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-01 12:48:21,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842080429] [2020-07-01 12:48:21,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:48:21,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:48:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:48:21,869 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 16 states. [2020-07-01 12:48:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:22,368 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-01 12:48:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:48:22,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2020-07-01 12:48:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:22,368 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:48:22,369 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:48:22,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2020-07-01 12:48:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:48:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:48:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:48:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:48:22,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-07-01 12:48:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:22,370 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:48:22,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:48:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:48:22,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:48:22,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 12:48:22,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:48:23,302 WARN L192 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2020-07-01 12:48:23,306 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-01 12:48:23,306 INFO L268 CegarLoopResult]: For program point L29-2(lines 26 40) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,307 INFO L268 CegarLoopResult]: For program point L15-7(lines 15 18) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L264 CegarLoopResult]: At program point L15-9(lines 15 18) the Hoare annotation is: (let ((.cse20 (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse21 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse8 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))) (let ((.cse2 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_cstrcmp_~s1.base ULTIMATE.start_main_~nondetString2~0.base))))) (.cse10 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))) (.cse12 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse8) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse14 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse21)) (.cse17 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse22 (- 1))))) (.cse18 (<= 1 .cse22)) (.cse19 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s1.base) (- 1))))))) (.cse0 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse1 (= .cse22 ULTIMATE.start_main_~length1~0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s2.base))) (.cse4 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse6 (<= 1 |#StackHeapBarrier|)) (.cse7 (<= 1 .cse20)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse11 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse13 (= 0 ULTIMATE.start_cstrcmp_~s2.offset)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse16 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s1.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse20) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse19) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse3 .cse4 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 (<= 1 .cse21) .cse15 .cse16 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))))) [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point L15-10(lines 15 18) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point L32-1(lines 32 34) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-07-01 12:48:23,309 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-01 12:48:23,310 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-01 12:48:23,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:48:23,312 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:48:23,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,333 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,361 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,361 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,361 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,361 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,362 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,362 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,362 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,362 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:23 BasicIcfg [2020-07-01 12:48:23,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:48:23,373 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:48:23,373 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:48:23,377 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:48:23,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:23,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:48:08" (1/5) ... [2020-07-01 12:48:23,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ac1234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:23, skipping insertion in model container [2020-07-01 12:48:23,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:23,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/5) ... [2020-07-01 12:48:23,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ac1234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:23, skipping insertion in model container [2020-07-01 12:48:23,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:23,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (3/5) ... [2020-07-01 12:48:23,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ac1234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:23, skipping insertion in model container [2020-07-01 12:48:23,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:23,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09" (4/5) ... [2020-07-01 12:48:23,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ac1234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:23, skipping insertion in model container [2020-07-01 12:48:23,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:23,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:23" (5/5) ... [2020-07-01 12:48:23,381 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:23,405 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:48:23,405 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:48:23,405 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:23,405 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:23,405 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:23,406 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:48:23,406 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:23,406 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:48:23,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-07-01 12:48:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:48:23,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:23,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:23,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:23,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:48:23,418 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:48:23,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-07-01 12:48:23,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:48:23,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:23,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:23,420 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:23,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:48:23,425 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [176] ULTIMATE.startENTRY-->L29: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 9#L29true [116] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 5#L29-2true [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 13#L32-1true [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc11.base_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 20#L37true [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 31#L37-1true [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 7#L15-9true [2020-07-01 12:48:23,426 INFO L796 eck$LassoCheckResult]: Loop: 7#L15-9true [79] L15-9-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 30#L15-1true [156] L15-1-->L15-2: Formula: (and (> 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 29#L15-2true [111] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short3_5|) InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} AuxVars[] AssignedVars[] 10#L15-7true [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 7#L15-9true [2020-07-01 12:48:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:23,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 1 times [2020-07-01 12:48:23,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:23,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610089539] [2020-07-01 12:48:23,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:23,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610089539] [2020-07-01 12:48:23,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:23,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:23,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410773664] [2020-07-01 12:48:23,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:48:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 3430452, now seen corresponding path program 1 times [2020-07-01 12:48:23,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:23,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734738896] [2020-07-01 12:48:23,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:23,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734738896] [2020-07-01 12:48:23,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:23,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:48:23,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910444156] [2020-07-01 12:48:23,459 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:48:23,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:23,460 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-01 12:48:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:23,534 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. [2020-07-01 12:48:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:23,537 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:48:23,540 INFO L168 Benchmark]: Toolchain (without parser) took 15291.30 ms. Allocated memory was 649.6 MB in the beginning and 918.0 MB in the end (delta: 268.4 MB). Free memory was 561.7 MB in the beginning and 448.3 MB in the end (delta: 113.5 MB). Peak memory consumption was 381.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,541 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:23,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.79 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 561.7 MB in the beginning and 633.1 MB in the end (delta: -71.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 670.0 MB. Free memory was 633.1 MB in the beginning and 630.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,542 INFO L168 Benchmark]: Boogie Preprocessor took 28.94 ms. Allocated memory is still 670.0 MB. Free memory was 630.3 MB in the beginning and 628.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,542 INFO L168 Benchmark]: RCFGBuilder took 365.82 ms. Allocated memory is still 670.0 MB. Free memory was 628.9 MB in the beginning and 602.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,542 INFO L168 Benchmark]: BlockEncodingV2 took 122.27 ms. Allocated memory is still 670.0 MB. Free memory was 602.7 MB in the beginning and 591.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,543 INFO L168 Benchmark]: TraceAbstraction took 14249.28 ms. Allocated memory was 670.0 MB in the beginning and 918.0 MB in the end (delta: 248.0 MB). Free memory was 591.9 MB in the beginning and 476.9 MB in the end (delta: 115.1 MB). Peak memory consumption was 363.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,543 INFO L168 Benchmark]: BuchiAutomizer took 165.92 ms. Allocated memory is still 918.0 MB. Free memory was 476.9 MB in the beginning and 457.7 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:23,546 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 39 locations, 44 edges - StatisticsResult: Encoded RCFG 29 locations, 53 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 310.79 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 561.7 MB in the beginning and 633.1 MB in the end (delta: -71.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 670.0 MB. Free memory was 633.1 MB in the beginning and 630.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.94 ms. Allocated memory is still 670.0 MB. Free memory was 630.3 MB in the beginning and 628.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 365.82 ms. Allocated memory is still 670.0 MB. Free memory was 628.9 MB in the beginning and 602.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 122.27 ms. Allocated memory is still 670.0 MB. Free memory was 602.7 MB in the beginning and 591.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 14249.28 ms. Allocated memory was 670.0 MB in the beginning and 918.0 MB in the end (delta: 248.0 MB). Free memory was 591.9 MB in the beginning and 476.9 MB in the end (delta: 115.1 MB). Peak memory consumption was 363.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 165.92 ms. Allocated memory is still 918.0 MB. Free memory was 476.9 MB in the beginning and 457.7 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 12:48:23,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:48:23,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:48:23,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:48:23,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:48:23,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:23,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:23,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((s1 == 0 && unknown-#length-unknown[nondetString1] == length1) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base))) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 <= ULTIMATE.start_main_~nondetString2~0.offset && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1]) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == s2) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 1 <= unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) || (((((((((((((((((((s1 + 1 <= unknown-#length-unknown[s1] && unknown-#length-unknown[nondetString1] == length1) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base))) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 <= s2) && 0 == nondetString2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 <= ULTIMATE.start_main_~nondetString2~0.offset && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1]) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 1 <= unknown-#length-unknown[nondetString1]) && 1 <= s1) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]))) || (((((((((((((((((s1 == 0 && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 0 == nondetString1) && 0 == s2) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 1 == nondetString1 + length1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.3s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 1915 SDslu, 582 SDs, 0 SdLazy, 1643 SolverSat, 159 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 151 SyntacticMatches, 5 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 70 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 398 HoareAnnotationTreeSize, 1 FomulaSimplifications, 942 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 188 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 426 ConstructedInterpolants, 43 QuantifiedInterpolants, 94256 SizeOfPredicates, 80 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 55/199 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:48:04.971 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_zJQ3ii/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:48:23.813 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check