java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:35:22,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:35:22,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:35:22,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:35:22,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:35:22,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:35:22,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:35:22,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:35:22,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:35:22,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:35:22,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:35:22,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:35:22,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:35:22,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:35:22,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:35:22,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:35:22,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:35:22,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:35:22,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:35:22,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:35:22,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:35:22,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:35:22,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:35:22,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:35:22,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:35:22,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:35:22,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:35:22,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:35:22,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:35:22,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:35:22,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:35:22,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:35:22,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:35:22,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:35:22,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:35:22,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:35:22,419 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:35:22,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:35:22,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:35:22,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:35:22,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:35:22,433 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:35:22,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:35:22,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:35:22,434 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:35:22,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:35:22,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:35:22,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:35:22,435 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:35:22,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:35:22,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:35:22,436 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:35:22,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:35:22,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:35:22,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:35:22,503 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:35:22,503 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:35:22,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-10-15 15:35:22,504 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-10-15 15:35:22,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:35:22,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:35:22,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:35:22,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:35:22,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:35:22,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... [2018-10-15 15:35:22,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:35:22,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:35:22,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:35:22,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:35:22,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:35:22,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:35:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:35:23,114 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:35:23,115 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:23 BoogieIcfgContainer [2018-10-15 15:35:23,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:35:23,115 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:35:23,116 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:35:23,117 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:35:23,121 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:23" (1/1) ... [2018-10-15 15:35:23,126 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:35:23,144 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:23 BasicIcfg [2018-10-15 15:35:23,144 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:35:23,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:35:23,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:35:23,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:35:23,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:22" (1/3) ... [2018-10-15 15:35:23,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e52017 and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:35:23, skipping insertion in model container [2018-10-15 15:35:23,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:23" (2/3) ... [2018-10-15 15:35:23,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e52017 and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:23, skipping insertion in model container [2018-10-15 15:35:23,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:23" (3/3) ... [2018-10-15 15:35:23,154 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:35:23,174 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:35:23,195 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:35:23,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:35:23,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:35:23,253 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:35:23,254 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:35:23,254 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:35:23,254 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:35:23,254 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:35:23,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:35:23,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:35:23,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:35:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-15 15:35:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 15:35:23,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:23,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:23,283 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:23,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2059478732, now seen corresponding path program 1 times [2018-10-15 15:35:23,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:23,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 15:35:23,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:35:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:35:23,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:35:23,569 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-10-15 15:35:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:23,779 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-10-15 15:35:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:35:23,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-15 15:35:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:23,794 INFO L225 Difference]: With dead ends: 47 [2018-10-15 15:35:23,794 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 15:35:23,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:35:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 15:35:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-15 15:35:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 15:35:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-15 15:35:23,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-10-15 15:35:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:23,836 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-15 15:35:23,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:35:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-15 15:35:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 15:35:23,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:23,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:23,837 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:23,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 560352205, now seen corresponding path program 1 times [2018-10-15 15:35:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:24,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:24,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:35:24,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:35:24,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:35:24,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:35:24,350 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-10-15 15:35:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:25,082 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-10-15 15:35:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:35:25,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-10-15 15:35:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:25,085 INFO L225 Difference]: With dead ends: 47 [2018-10-15 15:35:25,085 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 15:35:25,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:35:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 15:35:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-10-15 15:35:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 15:35:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-10-15 15:35:25,094 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2018-10-15 15:35:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:25,095 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-10-15 15:35:25,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:35:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-10-15 15:35:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 15:35:25,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:25,097 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:25,097 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:25,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1166667404, now seen corresponding path program 1 times [2018-10-15 15:35:25,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:25,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:35:25,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:35:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:35:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:35:25,386 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-10-15 15:35:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:25,578 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-15 15:35:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:35:25,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-15 15:35:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:25,581 INFO L225 Difference]: With dead ends: 50 [2018-10-15 15:35:25,582 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 15:35:25,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 15:35:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-15 15:35:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 15:35:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-15 15:35:25,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 31 [2018-10-15 15:35:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:25,596 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-15 15:35:25,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:35:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-15 15:35:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:35:25,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:25,598 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:25,598 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:25,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash -805343796, now seen corresponding path program 2 times [2018-10-15 15:35:25,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:25,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:25,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:35:25,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:35:25,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:35:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:25,814 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 7 states. [2018-10-15 15:35:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:26,034 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-10-15 15:35:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:35:26,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-15 15:35:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:26,037 INFO L225 Difference]: With dead ends: 61 [2018-10-15 15:35:26,037 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 15:35:26,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:35:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 15:35:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-10-15 15:35:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 15:35:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-10-15 15:35:26,044 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 42 [2018-10-15 15:35:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:26,045 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-15 15:35:26,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:35:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-10-15 15:35:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 15:35:26,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:26,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:26,048 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:26,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1756009868, now seen corresponding path program 3 times [2018-10-15 15:35:26,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:26,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:26,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:35:26,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:35:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:35:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:35:26,281 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 9 states. [2018-10-15 15:35:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:26,813 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-10-15 15:35:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:35:26,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-10-15 15:35:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:26,815 INFO L225 Difference]: With dead ends: 72 [2018-10-15 15:35:26,815 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 15:35:26,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 15:35:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-10-15 15:35:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 15:35:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-10-15 15:35:26,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 53 [2018-10-15 15:35:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:26,823 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-10-15 15:35:26,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:35:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-10-15 15:35:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 15:35:26,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:26,825 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:26,826 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:26,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1144943820, now seen corresponding path program 4 times [2018-10-15 15:35:26,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 28 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:27,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:27,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:35:27,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:35:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:35:27,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:35:27,232 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 11 states. [2018-10-15 15:35:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:27,581 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-10-15 15:35:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:35:27,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-10-15 15:35:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:27,585 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:35:27,585 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 15:35:27,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:35:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 15:35:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-10-15 15:35:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:35:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-10-15 15:35:27,592 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 64 [2018-10-15 15:35:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:27,593 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-10-15 15:35:27,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:35:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-10-15 15:35:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 15:35:27,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:27,595 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:27,595 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:27,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 826016628, now seen corresponding path program 5 times [2018-10-15 15:35:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 35 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:27,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:27,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:35:27,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:35:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:35:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:35:27,918 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 13 states. [2018-10-15 15:35:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:28,552 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-10-15 15:35:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:35:28,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-10-15 15:35:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:28,554 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:35:28,554 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:35:28,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:35:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:35:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 15:35:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 15:35:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-15 15:35:28,563 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 75 [2018-10-15 15:35:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:28,564 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-15 15:35:28,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:35:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-15 15:35:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:35:28,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:28,566 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:28,566 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:28,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash -898745396, now seen corresponding path program 6 times [2018-10-15 15:35:28,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:29,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:29,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:35:29,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:35:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:35:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:29,418 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 15 states. [2018-10-15 15:35:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:30,046 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-10-15 15:35:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:35:30,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-10-15 15:35:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:30,048 INFO L225 Difference]: With dead ends: 105 [2018-10-15 15:35:30,049 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 15:35:30,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:35:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 15:35:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-15 15:35:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 15:35:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-10-15 15:35:30,057 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 86 [2018-10-15 15:35:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:30,058 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-10-15 15:35:30,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:35:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-10-15 15:35:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 15:35:30,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:30,060 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:30,060 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:30,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1597627508, now seen corresponding path program 7 times [2018-10-15 15:35:30,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 49 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:30,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:30,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:35:30,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:35:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:35:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:35:30,543 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 17 states. [2018-10-15 15:35:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:31,778 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-10-15 15:35:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:35:31,779 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2018-10-15 15:35:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:31,781 INFO L225 Difference]: With dead ends: 116 [2018-10-15 15:35:31,781 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 15:35:31,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:35:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 15:35:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-10-15 15:35:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 15:35:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-10-15 15:35:31,789 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 97 [2018-10-15 15:35:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:31,789 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-10-15 15:35:31,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:35:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-10-15 15:35:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 15:35:31,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:31,791 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:31,792 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:31,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:31,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2122399028, now seen corresponding path program 8 times [2018-10-15 15:35:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 56 proven. 332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:32,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:32,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:35:32,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:35:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:35:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:35:32,199 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 19 states. [2018-10-15 15:35:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:33,227 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-15 15:35:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:35:33,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 108 [2018-10-15 15:35:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:33,229 INFO L225 Difference]: With dead ends: 127 [2018-10-15 15:35:33,230 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 15:35:33,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:35:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 15:35:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-10-15 15:35:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 15:35:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-10-15 15:35:33,238 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 108 [2018-10-15 15:35:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:33,238 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-10-15 15:35:33,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:35:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-10-15 15:35:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:35:33,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:33,240 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:33,241 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:33,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1281291636, now seen corresponding path program 9 times [2018-10-15 15:35:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 63 proven. 423 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:33,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:33,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:35:33,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:35:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:35:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:33,691 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 21 states. [2018-10-15 15:35:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:34,919 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-10-15 15:35:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:35:34,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 15:35:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:34,922 INFO L225 Difference]: With dead ends: 138 [2018-10-15 15:35:34,922 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 15:35:34,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:35:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 15:35:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-10-15 15:35:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 15:35:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-10-15 15:35:34,929 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 119 [2018-10-15 15:35:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:34,929 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-10-15 15:35:34,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:35:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-10-15 15:35:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 15:35:34,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:34,931 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:34,932 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:34,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1268774452, now seen corresponding path program 10 times [2018-10-15 15:35:34,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:35:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:35:35,037 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 15:35:35,105 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:35 BasicIcfg [2018-10-15 15:35:35,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:35:35,106 INFO L168 Benchmark]: Toolchain (without parser) took 12537.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 454.2 MB). Peak memory consumption was 483.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:35,108 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:35,109 INFO L168 Benchmark]: Boogie Preprocessor took 55.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:35,110 INFO L168 Benchmark]: RCFGBuilder took 488.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:35,111 INFO L168 Benchmark]: IcfgTransformer took 29.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:35,111 INFO L168 Benchmark]: TraceAbstraction took 11959.67 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 433.0 MB). Peak memory consumption was 461.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:35,117 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 488.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 29.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 11959.67 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 433.0 MB). Peak memory consumption was 461.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; VAL [main_~sn~5=0] [L17] main_~loop1~5 := main_#t~nondet0; VAL [main_#t~nondet0=2, main_~loop1~5=2, main_~sn~5=0] [L18] havoc main_#t~nondet0; VAL [main_~loop1~5=2, main_~sn~5=0] [L19] main_~n1~5 := main_#t~nondet1; VAL [main_#t~nondet1=3, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0] [L20] havoc main_#t~nondet1; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0] [L21] main_~x~5 := 0; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L24] assume true; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L25] assume !false; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L30] assume main_~x~5 % 4294967296 < 10; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=0] [L37] main_#t~post2 := main_~x~5; VAL [main_#t~post2=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=0] [L38] main_~x~5 := main_#t~post2 + 1; VAL [main_#t~post2=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L39] havoc main_#t~post2; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=1] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=1] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=2] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=2, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=2] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=2, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=3] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=3, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=3] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=3, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=4] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=4, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=4] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=4, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=5] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=5, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=5] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=5, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=6] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=6, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=6] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=6, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=7] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=7, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=7] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=7, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=8] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=8, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=8] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=8, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L30] assume main_~x~5 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=9] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=9, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=9] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=9, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L24] assume true; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L34] assume !(main_~x~5 % 4294967296 < 10); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L37] main_#t~post2 := main_~x~5; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=10, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L38] main_~x~5 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=10, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L41] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. UNSAFE Result, 11.8s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 509 SDtfs, 132 SDslu, 5108 SDs, 0 SdLazy, 3262 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 53 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 335683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 315/1770 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-35-35-139.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-35-35-139.csv Received shutdown request...