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-133090d [2018-10-04 09:46:34,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:46:34,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:46:34,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:46:34,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:46:34,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:46:34,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:46:34,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:46:34,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:46:34,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:46:34,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:46:34,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:46:34,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:46:34,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:46:34,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:46:34,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:46:34,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:46:34,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:46:34,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:46:34,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:46:34,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:46:34,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:46:34,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:46:34,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:46:34,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:46:34,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:46:34,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:46:34,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:46:34,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:46:34,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:46:34,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:46:34,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:46:34,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:46:34,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:46:34,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:46:34,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:46:34,780 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-04 09:46:34,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:46:34,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:46:34,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:46:34,798 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:46:34,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:46:34,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:46:34,799 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:46:34,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:46:34,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:46:34,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:46:34,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:46:34,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:46:34,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:46:34,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:46:34,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:46:34,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:46:34,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:46:34,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:46:34,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:46:34,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:46:34,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:46:34,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:46:34,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:34,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:46:34,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:46:34,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:46:34,805 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:46:34,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:46:34,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:46:34,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:46:34,805 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:46:34,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:46:34,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:46:34,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:46:34,883 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:46:34,884 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:46:34,885 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-04 09:46:34,887 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-04 09:46:34,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:46:34,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:46:34,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:34,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:46:34,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:46:35,018 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,038 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:35,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:46:35,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:46:35,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:46:35,071 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,071 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,075 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,078 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,098 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,106 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,112 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 04.10 09:46:34" (1/1) ... [2018-10-04 09:46:35,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:46:35,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:46:35,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:46:35,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:46:35,118 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 04.10 09:46:34" (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-04 09:46:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:46:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:46:35,966 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:46:35,967 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 04.10 09:46:35 BoogieIcfgContainer [2018-10-04 09:46:35,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:46:35,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:46:35,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:46:35,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:46:35,972 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 04.10 09:46:34" (1/2) ... [2018-10-04 09:46:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9ce3ab 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 04.10 09:46:35, skipping insertion in model container [2018-10-04 09:46:35,974 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 04.10 09:46:35" (2/2) ... [2018-10-04 09:46:35,975 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:46:35,986 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:46:35,997 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:46:36,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:46:36,047 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:46:36,047 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:46:36,047 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:46:36,047 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:46:36,047 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:46:36,047 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:46:36,048 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:46:36,048 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:46:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 09:46:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:36,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:36,071 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-04 09:46:36,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:36,078 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 09:46:36,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:36,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:36,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:36,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:36,333 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-04 09:46:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:36,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:36,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:36,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:36,356 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 09:46:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:36,422 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 09:46:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:36,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:36,446 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:46:36,446 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:46:36,455 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 1 [2018-10-04 09:46:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:46:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 09:46:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:46:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 09:46:36,498 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 09:46:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:36,498 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 09:46:36,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 09:46:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:36,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:36,500 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-04 09:46:36,501 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:36,501 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 09:46:36,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:36,670 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-04 09:46:36,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:36,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:36,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:36,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:36,673 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 09:46:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:36,710 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 09:46:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:36,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:36,712 INFO L225 Difference]: With dead ends: 103 [2018-10-04 09:46:36,712 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:46:36,713 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 1 [2018-10-04 09:46:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:46:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 09:46:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 09:46:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 09:46:36,735 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 09:46:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:36,736 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 09:46:36,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 09:46:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:36,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:36,737 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-04 09:46:36,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:36,738 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 09:46:36,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:36,894 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-04 09:46:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:36,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:46:36,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:46:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:46:36,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:36,896 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 09:46:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:37,101 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 09:46:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:46:37,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 09:46:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:37,113 INFO L225 Difference]: With dead ends: 141 [2018-10-04 09:46:37,114 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 09:46:37,114 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 3 [2018-10-04 09:46:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 09:46:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 09:46:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 09:46:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 09:46:37,149 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 09:46:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:37,150 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 09:46:37,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:46:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 09:46:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:37,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:37,151 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-04 09:46:37,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:37,152 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 09:46:37,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:37,325 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-04 09:46:37,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:37,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:37,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:37,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:37,327 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 09:46:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:37,400 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 09:46:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:37,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:37,402 INFO L225 Difference]: With dead ends: 183 [2018-10-04 09:46:37,403 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 09:46:37,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 1 [2018-10-04 09:46:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 09:46:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 09:46:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 09:46:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 09:46:37,428 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 09:46:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:37,429 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 09:46:37,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 09:46:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:37,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:37,431 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-04 09:46:37,431 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:37,431 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 09:46:37,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:37,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:37,548 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-04 09:46:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:37,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:37,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:37,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:37,550 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 09:46:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:37,627 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 09:46:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:37,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:37,630 INFO L225 Difference]: With dead ends: 321 [2018-10-04 09:46:37,630 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 09:46:37,631 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 1 [2018-10-04 09:46:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 09:46:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 09:46:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 09:46:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 09:46:37,679 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 09:46:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:37,680 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 09:46:37,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 09:46:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:37,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:37,682 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-04 09:46:37,683 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:37,683 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 09:46:37,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:37,831 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-04 09:46:37,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:37,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:37,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:37,834 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:37,835 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 09:46:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:37,984 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 09:46:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:37,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:37,988 INFO L225 Difference]: With dead ends: 633 [2018-10-04 09:46:37,989 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 09:46:37,990 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 1 [2018-10-04 09:46:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 09:46:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 09:46:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 09:46:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 09:46:38,095 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 09:46:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:38,096 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 09:46:38,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 09:46:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:38,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:38,102 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-04 09:46:38,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:38,102 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 09:46:38,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:38,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:38,237 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-04 09:46:38,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:38,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:38,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:38,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:38,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:38,239 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 09:46:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:38,447 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 09:46:38,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:38,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:38,452 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 09:46:38,453 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 09:46:38,454 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 1 [2018-10-04 09:46:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 09:46:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 09:46:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 09:46:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 09:46:38,585 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 09:46:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:38,586 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 09:46:38,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 09:46:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:38,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:38,589 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-04 09:46:38,589 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:38,589 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 09:46:38,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:38,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:38,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:38,674 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-04 09:46:38,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:38,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:38,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:38,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:38,676 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 09:46:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:39,001 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 09:46:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:39,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:39,012 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 09:46:39,012 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 09:46:39,014 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 1 [2018-10-04 09:46:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 09:46:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 09:46:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 09:46:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 09:46:39,276 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 09:46:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:39,276 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 09:46:39,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 09:46:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:39,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:39,281 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-04 09:46:39,281 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:39,281 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 09:46:39,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:39,630 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-04 09:46:39,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:46:39,631 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-04 09:46:39,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:39,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:46:40,807 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-04 09:46:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:46:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:46:40,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:46:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:46:40,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:40,886 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 09:46:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:44,849 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 09:46:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:46:44,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 09:46:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:44,866 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 09:46:44,867 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 09:46:44,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.1s impTime 13 [2018-10-04 09:46:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 09:46:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 09:46:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 09:46:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 09:46:45,293 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 09:46:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:45,294 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 09:46:45,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:46:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 09:46:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:46:45,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:45,298 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-04 09:46:45,298 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:45,298 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 09:46:45,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:45,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:45,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:45,439 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-04 09:46:45,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:45,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:45,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:45,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:45,443 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 09:46:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:46,031 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 09:46:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:46,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:46:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:46,042 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 09:46:46,042 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 09:46:46,045 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 1 [2018-10-04 09:46:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 09:46:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 09:46:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 09:46:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 09:46:46,401 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 09:46:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:46,401 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 09:46:46,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 09:46:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:46:46,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:46,406 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-04 09:46:46,406 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:46,407 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 09:46:46,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:46,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:46,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:46:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:46,496 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-04 09:46:46,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:46,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:46,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:46,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:46,500 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 09:46:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:46,538 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 09:46:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:46,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:46:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:46,539 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 09:46:46,539 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:46:46,541 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 1 [2018-10-04 09:46:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:46:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:46:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:46:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:46:46,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 09:46:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:46,542 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:46:46,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:46:46,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:46:46,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:46:46,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,719 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 09:46:46,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:46,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,008 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 09:46:47,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:47,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:48,955 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:46:50,163 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:50,427 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:50,584 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:51,240 WARN L178 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:46:51,404 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:51,617 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 09:46:51,761 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:52,059 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:52,221 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:52,375 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:46:52,699 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:52,702 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-04 09:46:52,703 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-04 09:46:52,703 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-04 09:46:52,703 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-04 09:46:52,704 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:52,704 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:52,704 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 09:46:52,704 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-04 09:46:52,704 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-04 09:46:52,705 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-04 09:46:52,705 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-04 09:46:52,705 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:52,705 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-04 09:46:52,706 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 09:46:52,706 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-04 09:46:52,706 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-04 09:46:52,706 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-04 09:46:52,707 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-04 09:46:52,707 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-04 09:46:52,707 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-04 09:46:52,708 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-04 09:46:52,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,764 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,770 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,770 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,771 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,773 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,774 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,783 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,785 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,785 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,788 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 04.10 09:46:52 BoogieIcfgContainer [2018-10-04 09:46:52,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:46:52,791 INFO L168 Benchmark]: Toolchain (without parser) took 17796.00 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 196.1 MB). Free memory was 1.4 GB in the beginning and 956.4 MB in the end (delta: 492.5 MB). Peak memory consumption was 688.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:52,792 INFO L168 Benchmark]: Boogie PL CUP Parser took 2.34 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-04 09:46:52,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.60 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-04 09:46:52,794 INFO L168 Benchmark]: Boogie Preprocessor took 59.85 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-04 09:46:52,795 INFO L168 Benchmark]: RCFGBuilder took 849.93 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-04 09:46:52,796 INFO L168 Benchmark]: TraceAbstraction took 16822.05 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 196.1 MB). Free memory was 1.4 GB in the beginning and 956.4 MB in the end (delta: 450.2 MB). Peak memory consumption was 646.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:52,804 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 2.34 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 59.60 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 59.85 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 849.93 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 16822.05 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 196.1 MB). Free memory was 1.4 GB in the beginning and 956.4 MB in the end (delta: 450.2 MB). Peak memory consumption was 646.3 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-04 09:46:52,826 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,828 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-04 09:46:52,833 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,833 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,834 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-04 09:46:52,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,836 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,836 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-04 09:46:52,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,838 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,838 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-04 09:46:52,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,840 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,841 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-04 09:46:52,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,844 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-04 09:46:52,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,846 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-04 09:46:52,847 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,849 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-04 09:46:52,850 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,850 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,851 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-04 09:46:52,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,853 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:52,853 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, 16.6s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s 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-04_09-46-52-862.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-04_09-46-52-862.csv Received shutdown request...