/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:43:07,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:43:07,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:43:07,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:43:07,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:43:07,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:43:07,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:43:07,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:43:07,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:43:07,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:43:07,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:43:07,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:43:07,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:43:07,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:43:07,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:43:07,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:43:07,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:43:07,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:43:07,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:43:07,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:43:07,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:43:07,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:43:07,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:43:07,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:43:07,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:43:07,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:43:07,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:43:07,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:43:07,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:43:07,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:43:07,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:43:07,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:43:07,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:43:07,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:43:07,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:43:07,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:43:07,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:43:07,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:43:07,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:43:07,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:43:07,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:43:07,096 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:43:07,110 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:43:07,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:43:07,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:43:07,112 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:43:07,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:43:07,112 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:43:07,112 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:43:07,113 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:43:07,113 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:43:07,113 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:43:07,113 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:43:07,113 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:43:07,114 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:43:07,114 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:43:07,114 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:43:07,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:43:07,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:43:07,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:43:07,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:43:07,115 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:43:07,115 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:43:07,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:43:07,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:43:07,116 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:43:07,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:43:07,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:43:07,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:43:07,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:43:07,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:43:07,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:43:07,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:43:07,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:43:07,298 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:43:07,299 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:43:07,299 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:43:07,366 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_qg9iMo/tmp/83daf102cd324ec18bef155ef119245c/FLAGbdba377d8 [2020-07-01 12:43:07,698 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:43:07,699 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:43:07,700 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:43:07,706 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_qg9iMo/tmp/83daf102cd324ec18bef155ef119245c/FLAGbdba377d8 [2020-07-01 12:43:08,102 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_qg9iMo/tmp/83daf102cd324ec18bef155ef119245c [2020-07-01 12:43:08,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:43:08,115 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:43:08,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:43:08,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:43:08,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:43:08,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f538be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08, skipping insertion in model container [2020-07-01 12:43:08,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:43:08,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:43:08,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:43:08,398 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:43:08,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:43:08,431 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:43:08,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08 WrapperNode [2020-07-01 12:43:08,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:43:08,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:43:08,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:43:08,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:43:08,442 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:43:08" (1/1) ... [2020-07-01 12:43:08,451 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:43:08" (1/1) ... [2020-07-01 12:43:08,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:43:08,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:43:08,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:43:08,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:43:08,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:43:08,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:43:08,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:43:08,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:43:08,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43: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:43:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:43:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:43:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:43:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:43:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:43:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:43:08,865 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:43:08,865 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:43:08,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:08 BoogieIcfgContainer [2020-07-01 12:43:08,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:43:08,870 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:43:08,870 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:43:08,872 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:43:08,872 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,888 INFO L313 BlockEncoder]: Initial Icfg 50 locations, 53 edges [2020-07-01 12:43:08,890 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:43:08,891 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:43:08,892 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:43:08,892 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:43:08,894 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:43:08,895 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:43:08,895 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:43:08,924 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:43:08,961 INFO L200 BlockEncoder]: SBE split 28 edges [2020-07-01 12:43:08,966 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:43:08,968 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:43:08,987 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:43:08,990 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:43:08,991 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:43:08,992 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:43:08,992 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:43:08,992 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:43:08,993 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 78 edges [2020-07-01 12:43:08,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:08 BasicIcfg [2020-07-01 12:43:08,994 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:43:08,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:43:08,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:43:08,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:43:08,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:43:08" (1/4) ... [2020-07-01 12:43:09,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5489a6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (2/4) ... [2020-07-01 12:43:09,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5489a6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:08" (3/4) ... [2020-07-01 12:43:09,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5489a6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:08" (4/4) ... [2020-07-01 12:43:09,003 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:43:09,013 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:43:09,021 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-07-01 12:43:09,035 INFO L251 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-07-01 12:43:09,058 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:43:09,058 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:43:09,059 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:43:09,059 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:43:09,059 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:43:09,059 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:43:09,059 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:43:09,059 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:43:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-01 12:43:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:09,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:09,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:09,082 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash 120441, now seen corresponding path program 1 times [2020-07-01 12:43:09,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:09,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989661110] [2020-07-01 12:43:09,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:09,285 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:43:09,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989661110] [2020-07-01 12:43:09,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:09,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:09,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754533157] [2020-07-01 12:43:09,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:09,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:09,311 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 12:43:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:09,504 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. [2020-07-01 12:43:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:09,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:09,519 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:43:09,519 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:43:09,523 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:43:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:43:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 12:43:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:43:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 68 transitions. [2020-07-01 12:43:09,567 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 68 transitions. Word has length 3 [2020-07-01 12:43:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:09,568 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 68 transitions. [2020-07-01 12:43:09,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 68 transitions. [2020-07-01 12:43:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:09,569 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:09,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:09,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:43:09,571 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash 120443, now seen corresponding path program 1 times [2020-07-01 12:43:09,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:09,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416227093] [2020-07-01 12:43:09,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:09,600 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:43:09,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416227093] [2020-07-01 12:43:09,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:09,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:09,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020625401] [2020-07-01 12:43:09,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:09,604 INFO L87 Difference]: Start difference. First operand 38 states and 68 transitions. Second operand 3 states. [2020-07-01 12:43:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:09,716 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2020-07-01 12:43:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:09,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:09,718 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:43:09,718 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:43:09,719 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:43:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:43:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 12:43:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:43:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2020-07-01 12:43:09,724 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 3 [2020-07-01 12:43:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:09,725 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2020-07-01 12:43:09,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2020-07-01 12:43:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:09,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:09,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:09,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:43:09,726 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash 120444, now seen corresponding path program 1 times [2020-07-01 12:43:09,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:09,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118919384] [2020-07-01 12:43:09,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:09,766 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:43:09,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118919384] [2020-07-01 12:43:09,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:09,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:09,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761077020] [2020-07-01 12:43:09,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:09,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:09,769 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 3 states. [2020-07-01 12:43:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:09,875 INFO L93 Difference]: Finished difference Result 38 states and 63 transitions. [2020-07-01 12:43:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:09,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:09,877 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:43:09,877 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:43:09,877 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:43:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:43:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:43:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:43:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. [2020-07-01 12:43:09,882 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 3 [2020-07-01 12:43:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:09,882 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 58 transitions. [2020-07-01 12:43:09,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2020-07-01 12:43:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:09,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:09,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:09,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:43:09,884 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash 3731170, now seen corresponding path program 1 times [2020-07-01 12:43:09,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:09,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091876282] [2020-07-01 12:43:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:09,919 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:43:09,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091876282] [2020-07-01 12:43:09,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298280765] [2020-07-01 12:43:09,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:09,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:09,922 INFO L87 Difference]: Start difference. First operand 33 states and 58 transitions. Second operand 3 states. [2020-07-01 12:43:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,029 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. [2020-07-01 12:43:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,031 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:43:10,031 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:43:10,031 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:43:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:43:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:43:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:43:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2020-07-01 12:43:10,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 4 [2020-07-01 12:43:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,036 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. [2020-07-01 12:43:10,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2020-07-01 12:43:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:10,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:10,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:43:10,037 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash 3731172, now seen corresponding path program 1 times [2020-07-01 12:43:10,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964404519] [2020-07-01 12:43:10,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,072 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:43:10,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964404519] [2020-07-01 12:43:10,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658909680] [2020-07-01 12:43:10,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,074 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. [2020-07-01 12:43:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,149 INFO L93 Difference]: Finished difference Result 33 states and 52 transitions. [2020-07-01 12:43:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,150 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:43:10,150 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:43:10,151 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:43:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:43:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:43:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:43:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2020-07-01 12:43:10,154 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 4 [2020-07-01 12:43:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,155 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-07-01 12:43:10,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2020-07-01 12:43:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:10,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:10,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:43:10,156 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 3731173, now seen corresponding path program 1 times [2020-07-01 12:43:10,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374673127] [2020-07-01 12:43:10,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,196 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:43:10,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374673127] [2020-07-01 12:43:10,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529420480] [2020-07-01 12:43:10,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,199 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2020-07-01 12:43:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,285 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2020-07-01 12:43:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,286 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:43:10,286 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:43:10,287 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:43:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:43:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:43:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:43:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-07-01 12:43:10,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 [2020-07-01 12:43:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,291 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-07-01 12:43:10,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-07-01 12:43:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:43:10,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:43:10,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:43:10,292 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash 115665044, now seen corresponding path program 1 times [2020-07-01 12:43:10,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562778166] [2020-07-01 12:43:10,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,321 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:43:10,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562778166] [2020-07-01 12:43:10,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533648322] [2020-07-01 12:43:10,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,324 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-07-01 12:43:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,400 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-07-01 12:43:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:43:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,401 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:43:10,402 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:43:10,402 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:43:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:43:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:43:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:43:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-07-01 12:43:10,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2020-07-01 12:43:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,406 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-07-01 12:43:10,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-07-01 12:43:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:43:10,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:43:10,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:43:10,407 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash 115665046, now seen corresponding path program 1 times [2020-07-01 12:43:10,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000580464] [2020-07-01 12:43:10,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,443 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:43:10,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000580464] [2020-07-01 12:43:10,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183159443] [2020-07-01 12:43:10,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,445 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-07-01 12:43:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,505 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-01 12:43:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:43:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,506 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:43:10,506 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:43:10,507 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:43:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:43:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:43:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:43:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:43:10,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:43:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,508 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:43:10,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:43:10,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:43:10,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:43:10,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:43:10,546 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,546 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,548 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:43:10,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,550 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point L14-6(lines 14 17) no Hoare annotation was computed. [2020-07-01 12:43:10,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:10,552 INFO L264 CegarLoopResult]: At program point L14-8(lines 14 17) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_quot_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_quot_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_quot_~i~0.base)) (= 0 ULTIMATE.start_quot_~y_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_quot_~y_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_quot_~x_ref~0.base)) (= 0 ULTIMATE.start_quot_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_quot_~y_ref~0.base)) (= 0 ULTIMATE.start_quot_~x_ref~0.offset)) [2020-07-01 12:43:10,552 INFO L268 CegarLoopResult]: For program point L14-9(lines 14 17) no Hoare annotation was computed. [2020-07-01 12:43:10,552 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:43:10,555 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:43:10,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:10 BasicIcfg [2020-07-01 12:43:10,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:43:10,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:43:10,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:43:10,579 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:43:10,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:10,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:43:08" (1/5) ... [2020-07-01 12:43:10,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ebb8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:43:10, skipping insertion in model container [2020-07-01 12:43:10,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:10,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08" (2/5) ... [2020-07-01 12:43:10,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ebb8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:43:10, skipping insertion in model container [2020-07-01 12:43:10,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:10,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:08" (3/5) ... [2020-07-01 12:43:10,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ebb8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:43:10, skipping insertion in model container [2020-07-01 12:43:10,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:10,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:08" (4/5) ... [2020-07-01 12:43:10,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ebb8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:43:10, skipping insertion in model container [2020-07-01 12:43:10,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:10,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:10" (5/5) ... [2020-07-01 12:43:10,584 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:43:10,605 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:43:10,605 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:43:10,606 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:43:10,606 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:43:10,606 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:43:10,606 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:43:10,606 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:43:10,606 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:43:10,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 12:43:10,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 12:43:10,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:43:10,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:43:10,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:10,620 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:10,620 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:43:10,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 12:43:10,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 12:43:10,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:43:10,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:43:10,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:10,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:10,629 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [89] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|)) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 15#L10true [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 35#L10-1true [120] L10-1-->L11: Formula: (and (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 39#L11true [90] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 20#L12true [104] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 42#L13true [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 30#L14-8true [2020-07-01 12:43:10,630 INFO L796 eck$LassoCheckResult]: Loop: 30#L14-8true [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 22#L14-1true [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 21#L14-2true [83] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_quot_#t~short6_5|) InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} AuxVars[] AssignedVars[] 33#L14-6true [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 26#L15true [86] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= 1 (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 44#L15-1true [218] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12) (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 6#L16true [101] L16-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 3#L16-1true [98] L16-1-->L16-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 25#L16-2true [219] L16-2-->L14-8: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* |v_ULTIMATE.start_quot_#t~mem9_6| (- 1))))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 30#L14-8true [2020-07-01 12:43:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 1 times [2020-07-01 12:43:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430781979] [2020-07-01 12:43:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,652 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:43:10,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430781979] [2020-07-01 12:43:10,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085447236] [2020-07-01 12:43:10,653 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:43:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1733919629, now seen corresponding path program 1 times [2020-07-01 12:43:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993171595] [2020-07-01 12:43:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,667 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:43:10,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993171595] [2020-07-01 12:43:10,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:43:10,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261944044] [2020-07-01 12:43:10,669 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:43:10,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,671 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 12:43:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,763 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2020-07-01 12:43:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,766 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:43:10,771 INFO L168 Benchmark]: Toolchain (without parser) took 2655.15 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 561.5 MB in the beginning and 415.4 MB in the end (delta: 146.1 MB). Peak memory consumption was 190.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,771 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:43:10,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.80 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 561.5 MB in the beginning and 655.9 MB in the end (delta: -94.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 694.2 MB. Free memory was 655.9 MB in the beginning and 653.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,773 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 694.2 MB. Free memory was 653.8 MB in the beginning and 652.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,774 INFO L168 Benchmark]: RCFGBuilder took 369.57 ms. Allocated memory is still 694.2 MB. Free memory was 652.7 MB in the beginning and 625.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,774 INFO L168 Benchmark]: BlockEncodingV2 took 124.09 ms. Allocated memory is still 694.2 MB. Free memory was 625.9 MB in the beginning and 615.1 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:43:10,775 INFO L168 Benchmark]: TraceAbstraction took 1579.88 ms. Allocated memory is still 694.2 MB. Free memory was 615.1 MB in the beginning and 441.4 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,775 INFO L168 Benchmark]: BuchiAutomizer took 193.05 ms. Allocated memory is still 694.2 MB. Free memory was 441.4 MB in the beginning and 415.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:10,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 50 locations, 53 edges - StatisticsResult: Encoded RCFG 43 locations, 78 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 315.80 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 561.5 MB in the beginning and 655.9 MB in the end (delta: -94.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 694.2 MB. Free memory was 655.9 MB in the beginning and 653.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 694.2 MB. Free memory was 653.8 MB in the beginning and 652.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 369.57 ms. Allocated memory is still 694.2 MB. Free memory was 652.7 MB in the beginning and 625.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 124.09 ms. Allocated memory is still 694.2 MB. Free memory was 625.9 MB in the beginning and 615.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1579.88 ms. Allocated memory is still 694.2 MB. Free memory was 615.1 MB in the beginning and 441.4 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 193.05 ms. Allocated memory is still 694.2 MB. Free memory was 441.4 MB in the beginning and 415.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 12]: 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: 11]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:43:10,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:10,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[i]) && 1 == \valid[i]) && 0 == y_ref) && 4 == unknown-#length-unknown[y_ref]) && 4 == unknown-#length-unknown[x_ref]) && 0 == i) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 24 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 325 SDslu, 5 SDs, 0 SdLazy, 353 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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:43:04.834 ----------------------------------------------- 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_qg9iMo/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:43:11.017 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check