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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:15:23,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:15:23,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:15:23,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:15:23,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:15:23,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:15:23,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:15:23,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:15:23,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:15:23,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:15:23,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:15:23,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:15:23,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:15:23,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:15:23,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:15:23,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:15:23,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:15:23,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:15:23,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:15:23,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:15:23,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:15:23,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:15:23,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:15:23,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:15:23,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:15:23,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:15:23,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:15:23,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:15:23,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:15:23,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:15:23,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:15:23,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:15:23,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:15:23,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:15:23,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:15:23,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:15:23,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:15:23,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:15:23,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:15:23,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:15:23,662 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:15:23,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:15:23,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:15:23,663 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:15:23,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:15:23,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:15:23,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:15:23,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:15:23,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:15:23,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:15:23,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:15:23,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:15:23,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:15:23,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:15:23,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:15:23,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:15:23,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:15:23,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:15:23,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:15:23,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:15:23,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:15:23,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:15:23,667 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:15:23,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:15:23,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:15:23,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:15:23,730 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:15:23,731 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:15:23,732 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.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 12:15:23,732 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-02 12:15:23,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:15:23,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:15:23,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:23,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:15:23,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:15:23,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:23,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:15:23,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:15:23,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:15:23,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/1) ... [2018-10-02 12:15:23,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:15:23,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:15:23,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:15:23,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:15:23,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (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-10-02 12:15:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:15:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:15:24,804 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:15:24,804 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:15:24 BoogieIcfgContainer [2018-10-02 12:15:24,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:15:24,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:15:24,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:15:24,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:15:24,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:15:23" (1/2) ... [2018-10-02 12:15:24,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711b6423 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:15:24, skipping insertion in model container [2018-10-02 12:15:24,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:15:24" (2/2) ... [2018-10-02 12:15:24,813 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 12:15:24,823 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:15:24,833 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:15:24,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:15:24,887 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:15:24,887 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:15:24,887 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:15:24,888 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:15:24,888 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:15:24,888 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:15:24,888 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:15:24,888 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:15:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 12:15:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:24,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:24,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:24,915 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:24,921 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-02 12:15:24,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:24,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:24,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:24,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:24,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:25,255 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-02 12:15:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:25,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:25,276 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:25,278 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-02 12:15:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:25,381 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-02 12:15:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:25,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:25,399 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:15:25,399 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 12:15:25,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 12:15:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-02 12:15:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:15:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-02 12:15:25,443 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-02 12:15:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:25,444 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-02 12:15:25,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-02 12:15:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:25,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:25,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:25,446 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:25,446 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-02 12:15:25,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:25,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:25,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:25,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:25,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:25,603 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-02 12:15:25,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:25,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:25,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:25,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:25,606 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-02 12:15:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:25,676 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-02 12:15:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:25,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:25,678 INFO L225 Difference]: With dead ends: 103 [2018-10-02 12:15:25,678 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 12:15:25,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 12:15:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-02 12:15:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 12:15:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-02 12:15:25,700 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-02 12:15:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:25,700 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-02 12:15:25,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-02 12:15:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:25,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:25,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:25,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:25,702 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-02 12:15:25,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:25,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:25,881 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-02 12:15:25,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:25,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:15:25,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:15:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:15:25,882 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:25,883 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-02 12:15:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:26,146 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-02 12:15:26,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:15:26,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-02 12:15:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:26,154 INFO L225 Difference]: With dead ends: 141 [2018-10-02 12:15:26,154 INFO L226 Difference]: Without dead ends: 139 [2018-10-02 12:15:26,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-02 12:15:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-02 12:15:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-02 12:15:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-02 12:15:26,197 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-02 12:15:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:26,197 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-02 12:15:26,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:15:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-02 12:15:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:26,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:26,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:26,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:26,199 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-02 12:15:26,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:26,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:26,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:26,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:26,324 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-02 12:15:26,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:26,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:26,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:26,326 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-02 12:15:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:26,439 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-02 12:15:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:26,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:26,449 INFO L225 Difference]: With dead ends: 183 [2018-10-02 12:15:26,449 INFO L226 Difference]: Without dead ends: 109 [2018-10-02 12:15:26,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-02 12:15:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-02 12:15:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 12:15:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-02 12:15:26,480 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-02 12:15:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:26,480 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-02 12:15:26,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-02 12:15:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:26,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:26,482 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:26,483 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:26,483 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-02 12:15:26,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:26,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:26,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:26,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:26,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:26,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:26,609 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-02 12:15:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:26,690 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-02 12:15:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:26,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:26,694 INFO L225 Difference]: With dead ends: 321 [2018-10-02 12:15:26,694 INFO L226 Difference]: Without dead ends: 215 [2018-10-02 12:15:26,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-02 12:15:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-02 12:15:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 12:15:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-02 12:15:26,764 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-02 12:15:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:26,765 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-02 12:15:26,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-02 12:15:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:26,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:26,773 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:26,773 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:26,773 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-02 12:15:26,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:26,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:26,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:26,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:26,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:26,957 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-02 12:15:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:27,220 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-02 12:15:27,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:27,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:27,225 INFO L225 Difference]: With dead ends: 633 [2018-10-02 12:15:27,225 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 12:15:27,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 12:15:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-02 12:15:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-02 12:15:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-02 12:15:27,300 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-02 12:15:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:27,300 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-02 12:15:27,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-02 12:15:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:27,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:27,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:27,307 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:27,307 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-02 12:15:27,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:27,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:27,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:27,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:27,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:27,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:27,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:27,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:27,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:27,454 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-02 12:15:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:27,684 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-02 12:15:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:27,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:27,693 INFO L225 Difference]: With dead ends: 1257 [2018-10-02 12:15:27,694 INFO L226 Difference]: Without dead ends: 839 [2018-10-02 12:15:27,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-02 12:15:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-02 12:15:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-02 12:15:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-02 12:15:27,818 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-02 12:15:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-02 12:15:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-02 12:15:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:27,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:27,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:27,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:27,828 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-02 12:15:27,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:27,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:27,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:27,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:27,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:27,945 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-02 12:15:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:28,317 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-02 12:15:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:28,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:28,327 INFO L225 Difference]: With dead ends: 2505 [2018-10-02 12:15:28,327 INFO L226 Difference]: Without dead ends: 1671 [2018-10-02 12:15:28,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-02 12:15:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-02 12:15:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-02 12:15:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-02 12:15:28,549 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-02 12:15:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:28,550 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-02 12:15:28,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-02 12:15:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:28,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:28,554 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, 1, 1, 1] [2018-10-02 12:15:28,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:28,554 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-02 12:15:28,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:28,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:15:28,685 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-10-02 12:15:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:28,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:15:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:15:30,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:15:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 12:15:30,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:15:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:15:30,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:30,060 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-02 12:15:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:34,847 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-02 12:15:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:15:34,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-02 12:15:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:34,861 INFO L225 Difference]: With dead ends: 4801 [2018-10-02 12:15:34,862 INFO L226 Difference]: Without dead ends: 3135 [2018-10-02 12:15:34,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.5s impTime [2018-10-02 12:15:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-02 12:15:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-02 12:15:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-02 12:15:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-02 12:15:35,247 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-02 12:15:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:35,248 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-02 12:15:35,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:15:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-02 12:15:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:35,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:35,260 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:15:35,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:35,260 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-02 12:15:35,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:35,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:35,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:35,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 12:15:35,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:35,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:35,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:35,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:35,403 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-02 12:15:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:35,879 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-02 12:15:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:35,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:35,888 INFO L225 Difference]: With dead ends: 4873 [2018-10-02 12:15:35,888 INFO L226 Difference]: Without dead ends: 2215 [2018-10-02 12:15:35,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-02 12:15:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-02 12:15:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-02 12:15:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-02 12:15:36,208 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-02 12:15:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:36,209 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-02 12:15:36,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-02 12:15:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:36,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:36,212 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 12:15:36,212 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:36,213 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-02 12:15:36,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:36,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:15:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-02 12:15:36,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:36,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:36,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:36,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:36,288 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-02 12:15:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:36,323 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-02 12:15:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:36,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:36,324 INFO L225 Difference]: With dead ends: 1799 [2018-10-02 12:15:36,324 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:15:36,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:15:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:15:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:15:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:15:36,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-02 12:15:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:36,328 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:15:36,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:15:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:15:36,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:15:36,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,459 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-02 12:15:36,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,703 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 12:15:36,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:36,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,292 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 12:15:37,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:37,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:38,548 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-02 12:15:39,581 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:40,104 WARN L178 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:40,278 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:41,015 WARN L178 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 12:15:41,223 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:41,376 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-02 12:15:41,576 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:41,785 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-02 12:15:41,915 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:42,157 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:42,311 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 12:15:42,413 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-02 12:15:42,524 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:42,528 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-02 12:15:42,528 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) 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-10-02 12:15:42,529 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) 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-10-02 12:15:42,529 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-02 12:15:42,529 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:42,529 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:42,529 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-02 12:15:42,530 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) 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-10-02 12:15:42,530 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) 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-10-02 12:15:42,530 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-02 12:15:42,530 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 12:15:42,531 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-02 12:15:42,531 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:42,531 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) 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-10-02 12:15:42,531 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 12:15:42,531 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) 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-10-02 12:15:42,532 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) 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-10-02 12:15:42,532 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) 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-10-02 12:15:42,532 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-02 12:15:42,532 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) 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-10-02 12:15:42,532 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) 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-10-02 12:15:42,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,565 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,589 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,590 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,590 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,600 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,602 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,604 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,604 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,608 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,609 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,620 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,629 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,633 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:15:42 BoogieIcfgContainer [2018-10-02 12:15:42,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:15:42,634 INFO L168 Benchmark]: Toolchain (without parser) took 18793.44 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 217.6 MB). Free memory was 1.4 GB in the beginning and 913.4 MB in the end (delta: 509.2 MB). Peak memory consumption was 726.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:42,635 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-02 12:15:42,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.64 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-02 12:15:42,637 INFO L168 Benchmark]: Boogie Preprocessor took 70.46 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-02 12:15:42,637 INFO L168 Benchmark]: RCFGBuilder took 826.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:42,638 INFO L168 Benchmark]: TraceAbstraction took 17827.50 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 217.6 MB). Free memory was 1.4 GB in the beginning and 913.4 MB in the end (delta: 467.0 MB). Peak memory consumption was 684.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:42,643 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.22 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. * Boogie Procedure Inliner took 60.64 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. * Boogie Preprocessor took 70.46 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. * RCFGBuilder took 826.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17827.50 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 217.6 MB). Free memory was 1.4 GB in the beginning and 913.4 MB in the end (delta: 467.0 MB). Peak memory consumption was 684.5 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] - 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] - 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: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-02 12:15:42,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,655 WARN L390 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: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-02 12:15:42,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,658 WARN L390 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: 485]: Loop Invariant [2018-10-02 12:15:42,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,660 WARN L390 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: 416]: Loop Invariant [2018-10-02 12:15:42,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-02 12:15:42,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,664 WARN L390 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: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: 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: 456]: Loop Invariant [2018-10-02 12:15:42,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,667 WARN L390 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: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-02 12:15:42,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,669 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,669 WARN L390 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: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-02 12:15:42,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,671 WARN L390 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: 364]: 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: 402]: Loop Invariant [2018-10-02 12:15:42,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-02 12:15:42,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:42,675 WARN L390 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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 17.6s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-15-42-682.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-15-42-682.csv Received shutdown request...