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/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:38:06,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:38:06,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:38:06,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:38:06,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:38:06,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:38:06,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:38:06,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:38:06,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:38:06,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:38:06,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:38:06,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:38:06,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:38:06,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:38:06,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:38:06,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:38:06,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:38:06,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:38:06,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:38:06,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:38:06,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:38:06,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:38:06,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:38:06,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:38:06,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:38:06,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:38:06,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:38:06,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:38:06,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:38:06,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:38:06,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:38:06,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:38:06,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:38:06,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:38:06,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:38:06,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:38:06,494 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:38:06,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:38:06,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:38:06,523 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:38:06,523 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:38:06,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:38:06,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:38:06,525 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:38:06,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:38:06,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:38:06,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:38:06,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:38:06,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:38:06,527 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:38:06,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:38:06,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:38:06,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:38:06,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:38:06,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:38:06,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:38:06,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:38:06,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:38:06,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:38:06,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:38:06,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:38:06,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:38:06,530 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:38:06,531 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:38:06,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:38:06,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:38:06,531 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:38:06,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:38:06,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:38:06,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:38:06,625 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:38:06,626 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:38:06,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-09-30 23:38:06,627 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl' [2018-09-30 23:38:06,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:38:06,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:38:06,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:38:06,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:38:06,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:38:06,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:38:06,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:38:06,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:38:06,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:38:06,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/1) ... [2018-09-30 23:38:06,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:38:06,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:38:06,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:38:06,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:38:06,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:38:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:38:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:38:07,494 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:38:07,495 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:38:07 BoogieIcfgContainer [2018-09-30 23:38:07,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:38:07,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:38:07,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:38:07,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:38:07,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:38:06" (1/2) ... [2018-09-30 23:38:07,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0825a1 and model type pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:38:07, skipping insertion in model container [2018-09-30 23:38:07,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:38:07" (2/2) ... [2018-09-30 23:38:07,503 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-09-30 23:38:07,512 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:38:07,520 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:38:07,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:38:07,564 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:38:07,564 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:38:07,564 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:38:07,564 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:38:07,564 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:38:07,564 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:38:07,565 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:38:07,565 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:38:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-09-30 23:38:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:38:07,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:07,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:07,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:07,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-09-30 23:38:07,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:07,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:07,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:07,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:07,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:07,862 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:07,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:38:07,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:07,882 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-09-30 23:38:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:07,955 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-09-30 23:38:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:07,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 23:38:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:07,967 INFO L225 Difference]: With dead ends: 39 [2018-09-30 23:38:07,967 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 23:38:07,971 INFO L605 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 [2018-09-30 23:38:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 23:38:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-30 23:38:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 23:38:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-09-30 23:38:08,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-09-30 23:38:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:08,018 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-09-30 23:38:08,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-09-30 23:38:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:38:08,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:08,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:08,020 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-09-30 23:38:08,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:08,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:08,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:38:08,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:38:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:38:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:38:08,227 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-09-30 23:38:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:08,397 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-09-30 23:38:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:38:08,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-30 23:38:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:08,399 INFO L225 Difference]: With dead ends: 46 [2018-09-30 23:38:08,400 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 23:38:08,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:38:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 23:38:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-09-30 23:38:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 23:38:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-09-30 23:38:08,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-09-30 23:38:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:08,427 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-09-30 23:38:08,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:38:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-09-30 23:38:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:38:08,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:08,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:08,431 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:08,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-09-30 23:38:08,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:08,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:08,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:08,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:38:08,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:08,545 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-09-30 23:38:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:08,567 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-09-30 23:38:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:08,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 23:38:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:08,569 INFO L225 Difference]: With dead ends: 55 [2018-09-30 23:38:08,569 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 23:38:08,570 INFO L605 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 [2018-09-30 23:38:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 23:38:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-09-30 23:38:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 23:38:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-09-30 23:38:08,586 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-09-30 23:38:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:08,587 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-09-30 23:38:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-09-30 23:38:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:38:08,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:08,588 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:08,589 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:08,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-09-30 23:38:08,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:08,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:08,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:08,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:38:08,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:08,758 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-09-30 23:38:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:08,832 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-09-30 23:38:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:08,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 23:38:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:08,834 INFO L225 Difference]: With dead ends: 111 [2018-09-30 23:38:08,835 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 23:38:08,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 23:38:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-09-30 23:38:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 23:38:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-09-30 23:38:08,875 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-09-30 23:38:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:08,876 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-09-30 23:38:08,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-09-30 23:38:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:38:08,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:08,878 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:08,878 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:08,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-09-30 23:38:08,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:08,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:09,016 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:09,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:38:09,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:09,018 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-09-30 23:38:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:09,079 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-09-30 23:38:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:09,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 23:38:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:09,083 INFO L225 Difference]: With dead ends: 213 [2018-09-30 23:38:09,083 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 23:38:09,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 23:38:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-09-30 23:38:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 23:38:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-09-30 23:38:09,119 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-09-30 23:38:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:09,119 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-09-30 23:38:09,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-09-30 23:38:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:38:09,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:09,123 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:38:09,123 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:09,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-09-30 23:38:09,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:09,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:09,285 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:09,285 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:38:09,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:09,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:38:09,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:09,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 23:38:09,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:38:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:38:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:38:09,572 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-09-30 23:38:09,872 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:38:10,220 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 23:38:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:11,045 INFO L93 Difference]: Finished difference Result 386 states and 480 transitions. [2018-09-30 23:38:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:38:11,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-30 23:38:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:11,048 INFO L225 Difference]: With dead ends: 386 [2018-09-30 23:38:11,048 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 23:38:11,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:38:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 23:38:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-09-30 23:38:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-30 23:38:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2018-09-30 23:38:11,098 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 22 [2018-09-30 23:38:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:11,098 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2018-09-30 23:38:11,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:38:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2018-09-30 23:38:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 23:38:11,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:11,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 23:38:11,101 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:11,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:11,102 INFO L82 PathProgramCache]: Analyzing trace with hash 518092167, now seen corresponding path program 2 times [2018-09-30 23:38:11,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:11,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 23:38:11,178 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:11,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:38:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:11,180 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 3 states. [2018-09-30 23:38:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:11,265 INFO L93 Difference]: Finished difference Result 375 states and 448 transitions. [2018-09-30 23:38:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:11,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 23:38:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:11,268 INFO L225 Difference]: With dead ends: 375 [2018-09-30 23:38:11,269 INFO L226 Difference]: Without dead ends: 187 [2018-09-30 23:38:11,270 INFO L605 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 [2018-09-30 23:38:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-30 23:38:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2018-09-30 23:38:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-30 23:38:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2018-09-30 23:38:11,321 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 42 [2018-09-30 23:38:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:11,325 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2018-09-30 23:38:11,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2018-09-30 23:38:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 23:38:11,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:11,330 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 23:38:11,330 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:11,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash -537457785, now seen corresponding path program 3 times [2018-09-30 23:38:11,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:11,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:11,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:38:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-30 23:38:11,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:38:11,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:38:11,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:38:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:38:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:38:11,390 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 3 states. [2018-09-30 23:38:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:11,397 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-09-30 23:38:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:38:11,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 23:38:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:11,398 INFO L225 Difference]: With dead ends: 153 [2018-09-30 23:38:11,398 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:38:11,399 INFO L605 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 [2018-09-30 23:38:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:38:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:38:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:38:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:38:11,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-09-30 23:38:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:11,402 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:38:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:38:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:38:11,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:38:11,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:38:11,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:11,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:11,718 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 23:38:11,820 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-09-30 23:38:12,117 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:38:12,340 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-09-30 23:38:12,566 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-09-30 23:38:12,718 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:38:13,029 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 23:38:13,107 INFO L422 ceAbstractionStarter]: At program point L289(lines 284 290) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-09-30 23:38:13,108 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 311) no Hoare annotation was computed. [2018-09-30 23:38:13,108 INFO L422 ceAbstractionStarter]: At program point L223(lines 214 224) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:38:13,108 INFO L422 ceAbstractionStarter]: At program point L246(lines 237 247) the Hoare annotation is: (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (<= 1 ~mode2)) (.cse5 (<= ~mode2 1)) (.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (not (= ~p2_old ~nomsg)) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse3 .cse4 .cse5 .cse0 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse1 .cse2 .cse6))) [2018-09-30 23:38:13,109 INFO L422 ceAbstractionStarter]: At program point L308(lines 199 308) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:38:13,109 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 310) no Hoare annotation was computed. [2018-09-30 23:38:13,109 INFO L422 ceAbstractionStarter]: At program point L228(lines 228 238) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:38:13,109 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 311) no Hoare annotation was computed. [2018-09-30 23:38:13,110 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 311) no Hoare annotation was computed. [2018-09-30 23:38:13,110 INFO L422 ceAbstractionStarter]: At program point L251(lines 251 260) the Hoare annotation is: (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (<= 1 ~mode2)) (.cse5 (<= ~mode2 1)) (.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (not (= ~p2_old ~nomsg)) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse3 .cse4 .cse5 .cse0 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse1 .cse2 .cse6))) [2018-09-30 23:38:13,110 INFO L422 ceAbstractionStarter]: At program point L278(lines 278 285) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 23:38:13,110 INFO L422 ceAbstractionStarter]: At program point L305(lines 305 309) the Hoare annotation is: false [2018-09-30 23:38:13,111 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 215) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:38:13,111 INFO L422 ceAbstractionStarter]: At program point L299(lines 299 306) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-09-30 23:38:13,111 INFO L422 ceAbstractionStarter]: At program point L266(lines 259 267) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:38:13,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,147 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:38:13 BoogieIcfgContainer [2018-09-30 23:38:13,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:38:13,148 INFO L168 Benchmark]: Toolchain (without parser) took 6420.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 362.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 7.1 GB. [2018-09-30 23:38:13,149 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-09-30 23:38:13,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.17 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-09-30 23:38:13,150 INFO L168 Benchmark]: Boogie Preprocessor took 30.89 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-09-30 23:38:13,151 INFO L168 Benchmark]: RCFGBuilder took 685.03 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:38:13,152 INFO L168 Benchmark]: TraceAbstraction took 5650.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2018-09-30 23:38:13,156 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.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. * Boogie Procedure Inliner took 46.17 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 30.89 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 685.03 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5650.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 310]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 259]: Loop Invariant [2018-09-30 23:38:13,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 251]: Loop Invariant [2018-09-30 23:38:13,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~78 - InvariantResult [Line: 237]: Loop Invariant [2018-09-30 23:38:13,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 278]: Loop Invariant [2018-09-30 23:38:13,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:38:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 5.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 137 SDslu, 148 SDs, 0 SdLazy, 135 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=6, 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 67 NumberOfFragments, 691 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2266 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 199 ConstructedInterpolants, 6 QuantifiedInterpolants, 15543 SizeOfPredicates, 1 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 148/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-38-13-187.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-38-13-187.csv Received shutdown request...