/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:59:22,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:59:22,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:59:22,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:59:22,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:59:22,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:59:22,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:59:22,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:59:22,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:59:22,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:59:22,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:59:22,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:59:22,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:59:22,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:59:22,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:59:22,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:59:22,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:59:22,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:59:22,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:59:22,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:59:22,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:59:22,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:59:22,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:59:22,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:59:22,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:59:22,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:59:22,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:59:22,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:59:22,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:59:22,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:59:22,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:59:22,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:59:22,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:59:22,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:59:22,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:59:22,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:59:22,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:59:22,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:59:22,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:59:22,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:59:22,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:59:22,212 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:59:22,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:59:22,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:59:22,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:59:22,227 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:59:22,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:59:22,228 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:59:22,228 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:59:22,228 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:59:22,228 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:59:22,229 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:59:22,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:59:22,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:59:22,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:59:22,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:59:22,230 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:59:22,231 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:59:22,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:59:22,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:59:22,231 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:59:22,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:59:22,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:59:22,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:59:22,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:59:22,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:59:22,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:59:22,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:59:22,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:59:22,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:59:22,414 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:59:22,415 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:59:22,480 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_DaIn3b/tmp/f528a5f0fd914f2985bb3964377de0d1/FLAGf38941aba [2020-07-01 12:59:22,810 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:59:22,811 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:59:22,811 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:59:22,817 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_DaIn3b/tmp/f528a5f0fd914f2985bb3964377de0d1/FLAGf38941aba [2020-07-01 12:59:23,223 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_DaIn3b/tmp/f528a5f0fd914f2985bb3964377de0d1 [2020-07-01 12:59:23,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:59:23,235 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:59:23,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:59:23,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:59:23,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:59:23,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462d1ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23, skipping insertion in model container [2020-07-01 12:59:23,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:59:23,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:59:23,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:59:23,521 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:59:23,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:59:23,555 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:59:23,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23 WrapperNode [2020-07-01 12:59:23,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:59:23,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:59:23,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:59:23,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:59:23,566 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:59:23" (1/1) ... [2020-07-01 12:59:23,575 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:59:23" (1/1) ... [2020-07-01 12:59:23,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:59:23,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:59:23,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:59:23,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:59:23,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:59:23,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:59:23,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:59:23,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:59:23,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (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:59:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:59:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:59:23,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:59:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:59:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:59:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:59:24,048 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:59:24,048 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:59:24,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:24 BoogieIcfgContainer [2020-07-01 12:59:24,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:59:24,056 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:59:24,056 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:59:24,058 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:59:24,059 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:24" (1/1) ... [2020-07-01 12:59:24,075 INFO L313 BlockEncoder]: Initial Icfg 64 locations, 67 edges [2020-07-01 12:59:24,077 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:59:24,077 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:59:24,078 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:59:24,078 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:59:24,080 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:59:24,081 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:59:24,081 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:59:24,110 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:59:24,155 INFO L200 BlockEncoder]: SBE split 35 edges [2020-07-01 12:59:24,160 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:59:24,162 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:59:24,202 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:59:24,205 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:59:24,207 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:59:24,207 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:59:24,208 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:59:24,208 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:59:24,209 INFO L313 BlockEncoder]: Encoded RCFG 55 locations, 105 edges [2020-07-01 12:59:24,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:24 BasicIcfg [2020-07-01 12:59:24,209 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:59:24,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:59:24,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:59:24,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:59:24,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:59:23" (1/4) ... [2020-07-01 12:59:24,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a60d259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:59:24, skipping insertion in model container [2020-07-01 12:59:24,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (2/4) ... [2020-07-01 12:59:24,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a60d259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:59:24, skipping insertion in model container [2020-07-01 12:59:24,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:24" (3/4) ... [2020-07-01 12:59:24,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a60d259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:24, skipping insertion in model container [2020-07-01 12:59:24,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:24" (4/4) ... [2020-07-01 12:59:24,218 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:59:24,229 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:59:24,236 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2020-07-01 12:59:24,250 INFO L251 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2020-07-01 12:59:24,273 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:59:24,273 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:59:24,274 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:59:24,274 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:59:24,274 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:59:24,274 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:59:24,274 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:59:24,274 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:59:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-01 12:59:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:59:24,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:59:24,297 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 137817, now seen corresponding path program 1 times [2020-07-01 12:59:24,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324403890] [2020-07-01 12:59:24,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,478 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:59:24,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324403890] [2020-07-01 12:59:24,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:24,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839686751] [2020-07-01 12:59:24,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:24,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:24,504 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2020-07-01 12:59:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:24,720 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2020-07-01 12:59:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:24,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:59:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:24,735 INFO L225 Difference]: With dead ends: 108 [2020-07-01 12:59:24,735 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 12:59:24,739 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:59:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 12:59:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-01 12:59:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 12:59:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2020-07-01 12:59:24,779 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 3 [2020-07-01 12:59:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:24,779 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 90 transitions. [2020-07-01 12:59:24,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 90 transitions. [2020-07-01 12:59:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:59:24,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:59:24,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:59:24,782 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 138065, now seen corresponding path program 1 times [2020-07-01 12:59:24,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115640642] [2020-07-01 12:59:24,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,849 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:59:24,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115640642] [2020-07-01 12:59:24,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:24,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261526952] [2020-07-01 12:59:24,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:24,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:24,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:24,853 INFO L87 Difference]: Start difference. First operand 55 states and 90 transitions. Second operand 3 states. [2020-07-01 12:59:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,001 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2020-07-01 12:59:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:59:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,024 INFO L225 Difference]: With dead ends: 55 [2020-07-01 12:59:25,024 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:59:25,025 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:59:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:59:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 12:59:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 12:59:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2020-07-01 12:59:25,032 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 3 [2020-07-01 12:59:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,032 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2020-07-01 12:59:25,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2020-07-01 12:59:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:59:25,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:59:25,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:59:25,033 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 138067, now seen corresponding path program 1 times [2020-07-01 12:59:25,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621728313] [2020-07-01 12:59:25,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,091 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:59:25,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621728313] [2020-07-01 12:59:25,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170653438] [2020-07-01 12:59:25,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,093 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand 3 states. [2020-07-01 12:59:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,233 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2020-07-01 12:59:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:59:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,235 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:59:25,235 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:59:25,236 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:59:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:59:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:59:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:59:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2020-07-01 12:59:25,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 3 [2020-07-01 12:59:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,242 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2020-07-01 12:59:25,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2020-07-01 12:59:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:59:25,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:59:25,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:59:25,243 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash 4277096, now seen corresponding path program 1 times [2020-07-01 12:59:25,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902107558] [2020-07-01 12:59:25,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,286 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:59:25,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902107558] [2020-07-01 12:59:25,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504597473] [2020-07-01 12:59:25,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,289 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2020-07-01 12:59:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,419 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2020-07-01 12:59:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:59:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,420 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:59:25,420 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:59:25,421 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:59:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:59:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:59:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:59:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-07-01 12:59:25,426 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 4 [2020-07-01 12:59:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,426 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-07-01 12:59:25,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-07-01 12:59:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:59:25,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:59:25,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:59:25,427 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash 4277098, now seen corresponding path program 1 times [2020-07-01 12:59:25,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184587178] [2020-07-01 12:59:25,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,476 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:59:25,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184587178] [2020-07-01 12:59:25,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25040950] [2020-07-01 12:59:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,478 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 3 states. [2020-07-01 12:59:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,583 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-07-01 12:59:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:59:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,584 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:59:25,584 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:59:25,585 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:59:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:59:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 12:59:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 12:59:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2020-07-01 12:59:25,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 4 [2020-07-01 12:59:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,590 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2020-07-01 12:59:25,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2020-07-01 12:59:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:59:25,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:25,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:59:25,591 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 132586813, now seen corresponding path program 1 times [2020-07-01 12:59:25,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809346712] [2020-07-01 12:59:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,632 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:59:25,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809346712] [2020-07-01 12:59:25,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791697128] [2020-07-01 12:59:25,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,634 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 3 states. [2020-07-01 12:59:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,718 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2020-07-01 12:59:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:59:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,719 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:59:25,720 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:59:25,720 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:59:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:59:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:59:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:59:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2020-07-01 12:59:25,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 5 [2020-07-01 12:59:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,725 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2020-07-01 12:59:25,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2020-07-01 12:59:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:59:25,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:25,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:59:25,726 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash 132586815, now seen corresponding path program 1 times [2020-07-01 12:59:25,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715300631] [2020-07-01 12:59:25,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,754 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:59:25,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715300631] [2020-07-01 12:59:25,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725980745] [2020-07-01 12:59:25,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,757 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 3 states. [2020-07-01 12:59:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,805 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2020-07-01 12:59:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:59:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,806 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:59:25,806 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:59:25,807 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:59:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:59:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:59:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:59:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2020-07-01 12:59:25,811 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 5 [2020-07-01 12:59:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,811 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-07-01 12:59:25,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2020-07-01 12:59:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:59:25,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:25,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:59:25,813 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,813 INFO L82 PathProgramCache]: Analyzing trace with hash 132586816, now seen corresponding path program 1 times [2020-07-01 12:59:25,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639587512] [2020-07-01 12:59:25,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,855 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:59:25,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639587512] [2020-07-01 12:59:25,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007261808] [2020-07-01 12:59:25,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,857 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand 3 states. [2020-07-01 12:59:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,934 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2020-07-01 12:59:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:25,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:59:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,936 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:59:25,936 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:59:25,936 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:59:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:59:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:59:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:59:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2020-07-01 12:59:25,940 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 5 [2020-07-01 12:59:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,941 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-07-01 12:59:25,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2020-07-01 12:59:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:59:25,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:59:25,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:59:25,942 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash -184778508, now seen corresponding path program 1 times [2020-07-01 12:59:25,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757149139] [2020-07-01 12:59:25,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,971 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:59:25,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757149139] [2020-07-01 12:59:25,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:25,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:25,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60529225] [2020-07-01 12:59:25,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:25,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:25,973 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 3 states. [2020-07-01 12:59:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:26,031 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-07-01 12:59:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:26,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:59:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:26,032 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:59:26,032 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:59:26,033 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:59:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:59:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:59:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:59:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-01 12:59:26,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 6 [2020-07-01 12:59:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:26,036 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-01 12:59:26,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-01 12:59:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:59:26,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:26,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:59:26,038 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash -184778506, now seen corresponding path program 1 times [2020-07-01 12:59:26,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34722383] [2020-07-01 12:59:26,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,065 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:59:26,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34722383] [2020-07-01 12:59:26,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:26,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:26,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983795507] [2020-07-01 12:59:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:26,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:26,067 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 3 states. [2020-07-01 12:59:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:26,102 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-01 12:59:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:26,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:59:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:26,103 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:59:26,104 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:59:26,104 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:59:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:59:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:59:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:59:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-01 12:59:26,107 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2020-07-01 12:59:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:26,108 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-01 12:59:26,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-01 12:59:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:59:26,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:26,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:59:26,109 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:59:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,109 INFO L82 PathProgramCache]: Analyzing trace with hash -184778505, now seen corresponding path program 1 times [2020-07-01 12:59:26,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917494548] [2020-07-01 12:59:26,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,140 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:59:26,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917494548] [2020-07-01 12:59:26,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:26,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:26,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772882611] [2020-07-01 12:59:26,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:59:26,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:26,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:26,142 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2020-07-01 12:59:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:26,180 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-01 12:59:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:26,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:59:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:26,181 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:59:26,181 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:59:26,181 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:59:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:59:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:59:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:59:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:59:26,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 12:59:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:26,183 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:59:26,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:59:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:59:26,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:59:26,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:59:26,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:59:26,262 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:59:26,262 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 22) no Hoare annotation was computed. [2020-07-01 12:59:26,263 INFO L264 CegarLoopResult]: At program point L15-3(lines 14 22) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:59:26,263 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:59:26,263 INFO L268 CegarLoopResult]: For program point L15-4(lines 15 22) no Hoare annotation was computed. [2020-07-01 12:59:26,263 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:59:26,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:59:26,265 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 19) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L264 CegarLoopResult]: At program point L16-4(lines 16 19) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point L16-5(lines 16 19) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:59:26,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:59:26,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:59:26,269 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:59:26,272 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:59:26,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:26 BasicIcfg [2020-07-01 12:59:26,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:59:26,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:59:26,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:59:26,303 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:59:26,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:26,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:59:23" (1/5) ... [2020-07-01 12:59:26,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee21093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:59:26, skipping insertion in model container [2020-07-01 12:59:26,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:26,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (2/5) ... [2020-07-01 12:59:26,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee21093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:59:26, skipping insertion in model container [2020-07-01 12:59:26,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:26,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:24" (3/5) ... [2020-07-01 12:59:26,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee21093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:59:26, skipping insertion in model container [2020-07-01 12:59:26,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:26,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:24" (4/5) ... [2020-07-01 12:59:26,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee21093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:59:26, skipping insertion in model container [2020-07-01 12:59:26,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:26,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:26" (5/5) ... [2020-07-01 12:59:26,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:59:26,338 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:59:26,338 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:59:26,338 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:59:26,339 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:59:26,339 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:59:26,339 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:59:26,339 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:59:26,339 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:59:26,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-07-01 12:59:26,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:59:26,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:59:26,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:59:26,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,356 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:59:26,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-07-01 12:59:26,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:59:26,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:59:26,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:59:26,360 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,360 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,365 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [106] 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] 9#L-1true [207] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4)) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 24#L11true [107] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 22#L11-1true [103] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 42#L12true [131] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 56#L13true [152] L13-->L15-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 27#L15-3true [2020-07-01 12:59:26,366 INFO L796 eck$LassoCheckResult]: Loop: 27#L15-3true [114] L15-3-->L15: Formula: (and (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 17#L15true [100] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 29#L15-1true [118] L15-1-->L16-4: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 43#L16-4true [135] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 31#L16-1true [119] L16-1-->L16-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 47#L16-2true [179] L16-2-->L16-5: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem7_4| |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 41#L16-5true [127] L16-5-->L20: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_9 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_9) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_12) v_ULTIMATE.start_test_fun_~c~0.offset_9))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_9, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_12, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_9, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 37#L20true [281] L20-->L21: Formula: (and (= 1 (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_25)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_19 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~c~0.base_25)) (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_25 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_25) v_ULTIMATE.start_test_fun_~c~0.offset_19 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_32|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_19)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_19, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_45|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_25} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_19, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_45|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 11#L21true [96] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_36|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 54#L21-1true [283] L21-1-->L15-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_58| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (= (store |v_#memory_int_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_36|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_36|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 27#L15-3true [2020-07-01 12:59:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash -178313929, now seen corresponding path program 1 times [2020-07-01 12:59:26,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673045436] [2020-07-01 12:59:26,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,384 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:59:26,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673045436] [2020-07-01 12:59:26,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:26,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:26,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004608103] [2020-07-01 12:59:26,386 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:59:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -458136363, now seen corresponding path program 1 times [2020-07-01 12:59:26,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796604754] [2020-07-01 12:59:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:59:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:59:26,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:59:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:26,590 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2020-07-01 12:59:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:26,705 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2020-07-01 12:59:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:26,707 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:59:26,712 INFO L168 Benchmark]: Toolchain (without parser) took 3476.11 ms. Allocated memory was 514.9 MB in the beginning and 597.7 MB in the end (delta: 82.8 MB). Free memory was 435.9 MB in the beginning and 509.9 MB in the end (delta: -74.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,713 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:59:26,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.44 ms. Allocated memory was 514.9 MB in the beginning and 559.9 MB in the end (delta: 45.1 MB). Free memory was 435.9 MB in the beginning and 527.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.19 ms. Allocated memory is still 559.9 MB. Free memory was 527.9 MB in the beginning and 526.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,714 INFO L168 Benchmark]: Boogie Preprocessor took 25.60 ms. Allocated memory is still 559.9 MB. Free memory was 526.2 MB in the beginning and 524.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,715 INFO L168 Benchmark]: RCFGBuilder took 430.62 ms. Allocated memory is still 559.9 MB. Free memory was 524.5 MB in the beginning and 496.0 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,715 INFO L168 Benchmark]: BlockEncodingV2 took 153.76 ms. Allocated memory is still 559.9 MB. Free memory was 496.0 MB in the beginning and 482.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,716 INFO L168 Benchmark]: TraceAbstraction took 2087.88 ms. Allocated memory was 559.9 MB in the beginning and 586.2 MB in the end (delta: 26.2 MB). Free memory was 481.3 MB in the beginning and 378.1 MB in the end (delta: 103.2 MB). Peak memory consumption was 129.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:26,716 INFO L168 Benchmark]: BuchiAutomizer took 410.58 ms. Allocated memory was 586.2 MB in the beginning and 597.7 MB in the end (delta: 11.5 MB). Free memory was 378.1 MB in the beginning and 509.9 MB in the end (delta: -131.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:59:26,720 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 64 locations, 67 edges - StatisticsResult: Encoded RCFG 55 locations, 105 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 319.44 ms. Allocated memory was 514.9 MB in the beginning and 559.9 MB in the end (delta: 45.1 MB). Free memory was 435.9 MB in the beginning and 527.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.19 ms. Allocated memory is still 559.9 MB. Free memory was 527.9 MB in the beginning and 526.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.60 ms. Allocated memory is still 559.9 MB. Free memory was 526.2 MB in the beginning and 524.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 430.62 ms. Allocated memory is still 559.9 MB. Free memory was 524.5 MB in the beginning and 496.0 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 153.76 ms. Allocated memory is still 559.9 MB. Free memory was 496.0 MB in the beginning and 482.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2087.88 ms. Allocated memory was 559.9 MB in the beginning and 586.2 MB in the end (delta: 26.2 MB). Free memory was 481.3 MB in the beginning and 378.1 MB in the end (delta: 103.2 MB). Peak memory consumption was 129.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 410.58 ms. Allocated memory was 586.2 MB in the beginning and 597.7 MB in the end (delta: 11.5 MB). Free memory was 378.1 MB in the beginning and 509.9 MB in the end (delta: -131.8 MB). There was no memory consumed. 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 12]: 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: 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: 21]: 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: 21]: 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: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 20]: 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: 21]: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: 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: 23]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:59:26,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,732 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:59:26,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:59:26,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:26,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 34 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 73 SDtfs, 563 SDslu, 6 SDs, 0 SdLazy, 532 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 112 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:59:19.920 ----------------------------------------------- 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_DaIn3b/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:59:26.965 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check