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.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:31:25,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:31:25,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:31:25,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:31:25,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:31:25,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:31:25,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:31:25,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:31:25,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:31:25,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:31:25,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:31:25,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:31:25,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:31:25,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:31:25,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:31:25,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:31:25,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:31:25,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:31:25,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:31:25,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:31:25,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:31:25,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:31:25,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:31:25,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:31:25,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:31:25,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:31:25,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:31:25,256 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:31:25,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:31:25,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:31:25,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:31:25,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:31:25,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:31:25,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:31:25,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:31:25,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:31:25,263 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 14:31:25,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:31:25,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:31:25,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:31:25,287 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:31:25,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:31:25,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:31:25,288 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:31:25,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:31:25,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:31:25,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:31:25,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:31:25,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:31:25,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:31:25,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:31:25,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:31:25,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:31:25,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:31:25,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:31:25,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:31:25,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:31:25,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:31:25,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:31:25,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:25,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:31:25,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:31:25,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:31:25,294 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:31:25,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:31:25,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:31:25,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:31:25,295 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:31:25,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:31:25,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:31:25,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:31:25,361 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:31:25,361 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:31:25,362 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.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 14:31:25,363 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 14:31:25,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:31:25,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:31:25,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:25,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:31:25,456 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:31:25,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:25,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:31:25,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:31:25,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:31:25,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/1) ... [2018-10-04 14:31:25,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:31:25,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:31:25,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:31:25,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:31:25,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (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 14:31:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:31:25,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:31:26,351 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:31:26,352 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:26 BoogieIcfgContainer [2018-10-04 14:31:26,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:31:26,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:31:26,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:31:26,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:31:26,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:25" (1/2) ... [2018-10-04 14:31:26,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5aaf6e and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:31:26, skipping insertion in model container [2018-10-04 14:31:26,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:26" (2/2) ... [2018-10-04 14:31:26,362 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 14:31:26,371 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:31:26,383 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:31:26,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:31:26,427 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:31:26,427 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:31:26,427 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:31:26,427 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:31:26,427 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:31:26,428 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:31:26,428 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:31:26,428 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:31:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 14:31:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:26,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:26,451 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 14:31:26,452 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:26,459 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 14:31:26,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:26,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:26,750 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 14:31:26,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:26,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:26,771 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 14:31:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:26,831 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 14:31:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:26,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:26,852 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:31:26,852 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:31:26,856 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 14:31:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:31:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 14:31:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:31:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 14:31:26,899 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 14:31:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:26,900 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 14:31:26,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 14:31:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:26,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:26,901 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 14:31:26,902 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:26,902 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 14:31:26,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:26,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:26,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:27,091 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 14:31:27,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:27,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:27,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:27,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:27,094 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 14:31:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:27,146 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 14:31:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:27,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:27,148 INFO L225 Difference]: With dead ends: 103 [2018-10-04 14:31:27,148 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:31:27,149 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 14:31:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:31:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 14:31:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:31:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 14:31:27,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 14:31:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:27,181 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 14:31:27,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 14:31:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:27,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:27,183 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 14:31:27,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:27,183 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 14:31:27,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:27,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:27,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:27,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:27,364 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 14:31:27,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:27,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:31:27,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:31:27,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:31:27,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:27,365 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 14:31:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:27,543 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 14:31:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:31:27,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 14:31:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:27,556 INFO L225 Difference]: With dead ends: 141 [2018-10-04 14:31:27,556 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 14:31:27,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:31:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 14:31:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 14:31:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:31:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 14:31:27,600 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 14:31:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:27,602 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 14:31:27,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:31:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 14:31:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:27,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:27,603 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 14:31:27,603 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:27,604 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 14:31:27,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:27,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:27,741 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 14:31:27,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:27,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:27,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:27,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:27,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:27,743 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 14:31:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:27,825 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 14:31:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:27,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:27,828 INFO L225 Difference]: With dead ends: 183 [2018-10-04 14:31:27,828 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 14:31:27,829 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 14:31:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 14:31:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 14:31:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 14:31:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 14:31:27,856 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 14:31:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:27,856 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 14:31:27,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 14:31:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:27,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:27,858 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 14:31:27,859 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:27,859 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 14:31:27,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:28,034 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 14:31:28,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:28,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:28,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:28,036 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 14:31:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:28,146 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 14:31:28,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:28,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:28,150 INFO L225 Difference]: With dead ends: 321 [2018-10-04 14:31:28,150 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 14:31:28,152 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 14:31:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 14:31:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 14:31:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 14:31:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 14:31:28,211 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 14:31:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:28,211 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 14:31:28,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 14:31:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:28,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:28,216 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 14:31:28,217 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:28,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 14:31:28,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:28,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:28,370 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 14:31:28,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:28,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:28,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:28,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:28,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:28,372 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 14:31:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:28,496 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 14:31:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:28,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:28,499 INFO L225 Difference]: With dead ends: 633 [2018-10-04 14:31:28,499 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 14:31:28,501 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 14:31:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 14:31:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 14:31:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 14:31:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 14:31:28,572 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 14:31:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:28,573 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 14:31:28,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 14:31:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:28,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:28,576 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 14:31:28,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:28,577 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 14:31:28,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:28,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:28,698 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 14:31:28,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:28,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:28,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:28,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:28,699 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 14:31:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:28,885 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 14:31:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:28,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:28,890 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 14:31:28,891 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 14:31:28,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 14:31:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 14:31:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 14:31:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 14:31:29,013 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 14:31:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:29,013 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 14:31:29,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 14:31:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:29,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:29,019 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 14:31:29,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:29,020 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 14:31:29,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:29,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:29,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:29,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:29,133 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 14:31:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:29,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:29,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:29,135 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 14:31:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:29,459 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 14:31:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:29,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:29,469 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 14:31:29,469 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 14:31:29,471 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 14:31:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 14:31:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 14:31:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 14:31:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 14:31:29,698 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 14:31:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:29,699 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 14:31:29,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 14:31:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:29,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:29,702 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 14:31:29,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:29,703 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 14:31:29,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:29,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:29,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:29,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:29,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:29,902 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 14:31:29,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:31:29,902 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 14:31:29,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:30,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:31:30,982 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 14:31:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:31:31,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 14:31:31,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:31:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:31:31,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:31,017 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 14:31:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:33,738 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 14:31:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:31:33,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 14:31:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:33,753 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 14:31:33,754 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 14:31:33,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.6s impTime 13 [2018-10-04 14:31:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 14:31:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 14:31:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 14:31:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 14:31:34,117 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 14:31:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:34,117 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 14:31:34,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:31:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 14:31:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:31:34,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:34,121 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 14:31:34,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:34,122 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 14:31:34,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:34,267 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 14:31:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:34,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:34,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:34,269 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 14:31:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:34,845 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 14:31:34,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:34,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 14:31:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:34,855 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 14:31:34,855 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 14:31:34,859 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 14:31:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 14:31:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 14:31:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 14:31:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 14:31:35,131 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 14:31:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:35,131 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 14:31:35,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 14:31:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:31:35,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:35,135 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 14:31:35,135 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:35,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 14:31:35,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:35,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:35,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:31:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:35,234 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 14:31:35,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:35,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:35,236 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 14:31:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:35,277 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 14:31:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:35,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 14:31:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:35,278 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 14:31:35,278 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:31:35,280 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 14:31:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:31:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:31:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:31:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:31:35,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 14:31:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:35,281 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:31:35,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:31:35,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:31:35,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:31:35,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,432 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 14:31:35,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,702 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 14:31:35,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,506 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 14:31:38,741 WARN L178 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:39,293 WARN L178 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:39,521 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:39,694 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 14:31:40,142 WARN L178 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:40,318 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 14:31:40,548 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:40,764 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 14:31:41,000 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:41,125 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:41,267 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 14:31:41,550 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:41,552 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 14:31:41,553 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 14:31:41,553 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 14:31:41,553 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 14:31:41,553 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 14:31:41,553 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 14:31:41,554 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 14:31:41,554 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 14:31:41,554 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 14:31:41,554 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 14:31:41,554 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 14:31:41,554 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 14:31:41,555 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 14:31:41,555 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 14:31:41,555 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 14:31:41,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 14:31:41,555 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 14:31:41,556 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 14:31:41,556 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 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 14:31:41,556 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 14:31:41,556 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 14:31:41,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,573 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,585 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,585 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,589 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,589 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,596 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,597 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,602 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,605 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,605 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,618 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:31:41 BoogieIcfgContainer [2018-10-04 14:31:41,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:31:41,619 INFO L168 Benchmark]: Toolchain (without parser) took 16165.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 218.6 MB). Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 448.4 MB). Peak memory consumption was 667.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:41,621 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 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 14:31:41,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.51 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 14:31:41,622 INFO L168 Benchmark]: Boogie Preprocessor took 66.29 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 14:31:41,623 INFO L168 Benchmark]: RCFGBuilder took 781.76 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 14:31:41,624 INFO L168 Benchmark]: TraceAbstraction took 15263.32 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 218.6 MB). Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 406.1 MB). Peak memory consumption was 624.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:41,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.28 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 47.51 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 66.29 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 781.76 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 15263.32 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 218.6 MB). Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 406.1 MB). Peak memory consumption was 624.8 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 14:31:41,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,652 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 14:31:41,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-04 14:31:41,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,663 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 14:31:41,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,668 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 14:31:41,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,673 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 14:31:41,676 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,676 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,683 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 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 14:31:41,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,686 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 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 14:31:41,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,689 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 14:31:41,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,696 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,697 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,697 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 14:31:41,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:41,702 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, 15.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s 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.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-31-41-709.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-31-41-709.csv Received shutdown request...