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.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:46:25,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:46:25,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:46:25,233 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:46:25,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:46:25,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:46:25,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:46:25,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:46:25,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:46:25,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:46:25,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:46:25,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:46:25,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:46:25,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:46:25,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:46:25,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:46:25,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:46:25,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:46:25,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:46:25,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:46:25,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:46:25,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:46:25,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:46:25,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:46:25,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:46:25,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:46:25,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:46:25,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:46:25,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:46:25,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:46:25,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:46:25,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:46:25,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:46:25,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:46:25,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:46:25,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:46:25,286 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:46:25,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:46:25,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:46:25,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:46:25,316 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:46:25,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:46:25,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:46:25,317 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:46:25,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:46:25,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:46:25,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:46:25,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:46:25,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:46:25,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:46:25,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:46:25,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:46:25,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:46:25,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:46:25,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:46:25,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:46:25,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:46:25,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:46:25,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:46:25,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:25,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:46:25,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:46:25,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:46:25,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:46:25,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:46:25,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:46:25,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:46:25,322 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:46:25,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:46:25,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:46:25,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:46:25,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:46:25,388 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:46:25,389 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:46:25,389 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 09:46:25,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:46:25,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:46:25,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:25,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:46:25,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:46:25,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:25,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:46:25,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:46:25,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:46:25,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/1) ... [2018-10-04 09:46:25,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:46:25,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:46:25,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:46:25,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:46:25,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46: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 09:46:25,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:46:25,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:46:26,336 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:46:26,337 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:26 BoogieIcfgContainer [2018-10-04 09:46:26,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:46:26,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:46:26,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:46:26,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:46:26,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:25" (1/2) ... [2018-10-04 09:46:26,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f972cc and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:46:26, skipping insertion in model container [2018-10-04 09:46:26,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:26" (2/2) ... [2018-10-04 09:46:26,345 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:46:26,354 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:46:26,362 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:46:26,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:46:26,411 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:46:26,411 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:46:26,411 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:46:26,411 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:46:26,412 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:46:26,412 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:46:26,412 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:46:26,412 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:46:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 09:46:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:26,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:26,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:26,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:26,442 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-04 09:46:26,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:26,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:26,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:26,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:26,702 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 09:46:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:26,763 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-04 09:46:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:26,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:46:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:26,778 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:46:26,778 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:46:26,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:46:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-04 09:46:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:46:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-04 09:46:26,826 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-04 09:46:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:26,826 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-04 09:46:26,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 09:46:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:26,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:26,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:26,828 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:26,828 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-04 09:46:26,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:26,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:26,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:26,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:26,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:26,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:26,977 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-04 09:46:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:27,023 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-04 09:46:27,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:27,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:46:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:27,025 INFO L225 Difference]: With dead ends: 91 [2018-10-04 09:46:27,025 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 09:46:27,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 09:46:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-04 09:46:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:46:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-04 09:46:27,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-04 09:46:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:27,049 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-04 09:46:27,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 09:46:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:27,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:27,050 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:27,051 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:27,051 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-04 09:46:27,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:27,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:27,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:27,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:27,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:27,186 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-04 09:46:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:27,258 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-04 09:46:27,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:27,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:46:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:27,271 INFO L225 Difference]: With dead ends: 175 [2018-10-04 09:46:27,271 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 09:46:27,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 09:46:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 09:46:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 09:46:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-04 09:46:27,320 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-04 09:46:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:27,324 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-04 09:46:27,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-04 09:46:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:27,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:27,325 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:27,326 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:27,326 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-04 09:46:27,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:27,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:27,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:27,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:27,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:27,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:27,461 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-04 09:46:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:27,517 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-04 09:46:27,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:27,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:46:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:27,520 INFO L225 Difference]: With dead ends: 343 [2018-10-04 09:46:27,520 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 09:46:27,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 09:46:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-04 09:46:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 09:46:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-04 09:46:27,577 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-04 09:46:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:27,578 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-04 09:46:27,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-04 09:46:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:27,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:27,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:27,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:27,579 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-04 09:46:27,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:27,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:27,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:27,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:27,673 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-04 09:46:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:27,786 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-04 09:46:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:27,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:46:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:27,791 INFO L225 Difference]: With dead ends: 569 [2018-10-04 09:46:27,791 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 09:46:27,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 09:46:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-04 09:46:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 09:46:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-04 09:46:27,858 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-04 09:46:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:27,859 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-04 09:46:27,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-04 09:46:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:46:27,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:27,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:27,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:27,861 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-04 09:46:27,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:27,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:28,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:46:28,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:46:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:46:28,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:28,023 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-04 09:46:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:28,331 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-04 09:46:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:46:28,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:46:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:28,335 INFO L225 Difference]: With dead ends: 610 [2018-10-04 09:46:28,335 INFO L226 Difference]: Without dead ends: 608 [2018-10-04 09:46:28,336 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 09:46:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-04 09:46:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-04 09:46:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-04 09:46:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-04 09:46:28,403 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-04 09:46:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:28,403 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-04 09:46:28,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:46:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-04 09:46:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:46:28,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:28,406 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] [2018-10-04 09:46:28,406 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:28,407 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-04 09:46:28,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:28,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:28,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:28,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:28,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:28,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:28,528 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-04 09:46:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:28,701 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-04 09:46:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:28,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:46:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:28,706 INFO L225 Difference]: With dead ends: 1113 [2018-10-04 09:46:28,706 INFO L226 Difference]: Without dead ends: 743 [2018-10-04 09:46:28,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-04 09:46:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-04 09:46:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 09:46:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-04 09:46:28,822 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-04 09:46:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:28,822 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-04 09:46:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-04 09:46:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:46:28,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:28,826 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:28,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:28,827 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-04 09:46:28,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:29,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:46:29,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:46:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:29,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:46:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:46:30,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:46:30,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:46:30,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:46:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:46:30,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:30,530 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-04 09:46:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:32,977 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-04 09:46:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:46:32,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-04 09:46:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:32,985 INFO L225 Difference]: With dead ends: 2109 [2018-10-04 09:46:32,985 INFO L226 Difference]: Without dead ends: 1371 [2018-10-04 09:46:32,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 0.7s impTime 13 [2018-10-04 09:46:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-04 09:46:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-04 09:46:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 09:46:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-04 09:46:33,241 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-04 09:46:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:33,241 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-04 09:46:33,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:46:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-04 09:46:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:46:33,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:33,245 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:46:33,248 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:33,248 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:33,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-04 09:46:33,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:33,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:33,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:33,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 09:46:33,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:33,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:33,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:33,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:33,396 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-04 09:46:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:33,750 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-04 09:46:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:33,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 09:46:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:33,758 INFO L225 Difference]: With dead ends: 2161 [2018-10-04 09:46:33,758 INFO L226 Difference]: Without dead ends: 975 [2018-10-04 09:46:33,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-04 09:46:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-04 09:46:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-04 09:46:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-04 09:46:33,959 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-04 09:46:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:33,959 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-04 09:46:33,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-04 09:46:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:46:33,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:33,961 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 09:46:33,961 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:33,962 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-04 09:46:33,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:33,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:46:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 09:46:34,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:34,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:34,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:34,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:34,069 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-04 09:46:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:34,092 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-04 09:46:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:34,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 09:46:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:34,093 INFO L225 Difference]: With dead ends: 799 [2018-10-04 09:46:34,093 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:46:34,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:46:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:46:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:46:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:46:34,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-04 09:46:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:34,095 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:46:34,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:46:34,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:46:34,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:46:34,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:34,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:36,764 WARN L178 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 09:46:37,037 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:38,564 WARN L178 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 09:46:38,696 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 09:46:38,928 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 09:46:39,048 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 09:46:39,258 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 09:46:39,822 WARN L178 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:40,107 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 09:46:40,762 WARN L178 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 09:46:41,146 WARN L178 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 09:46:41,318 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 09:46:41,321 INFO L421 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-10-04 09:46:41,321 INFO L421 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:46:41,321 INFO L421 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:46:41,322 INFO L421 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-10-04 09:46:41,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:46:41,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:46:41,322 INFO L421 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 09:46:41,322 INFO L421 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 09:46:41,322 INFO L421 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-04 09:46:41,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:46:41,323 INFO L421 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:41,323 INFO L421 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:41,323 INFO L421 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 09:46:41,323 INFO L421 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:41,323 INFO L421 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:46:41,323 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-04 09:46:41,324 INFO L421 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:46:41,324 INFO L421 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:46:41,324 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-04 09:46:41,332 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,333 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,343 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,350 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,350 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,353 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,354 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,365 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,365 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,372 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,372 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,392 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:46:41 BoogieIcfgContainer [2018-10-04 09:46:41,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:46:41,393 INFO L168 Benchmark]: Toolchain (without parser) took 15905.68 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -95.6 MB). Peak memory consumption was 591.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:41,397 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:41,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.49 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:41,399 INFO L168 Benchmark]: Boogie Preprocessor took 64.03 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:41,400 INFO L168 Benchmark]: RCFGBuilder took 735.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:41,401 INFO L168 Benchmark]: TraceAbstraction took 15054.14 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -127.3 MB). Peak memory consumption was 560.2 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:41,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.49 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.03 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 735.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15054.14 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -127.3 MB). Peak memory consumption was 560.2 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-10-04 09:46:41,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-10-04 09:46:41,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,436 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: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-10-04 09:46:41,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-10-04 09:46:41,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-10-04 09:46:41,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-10-04 09:46:41,449 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,449 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,450 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: 358]: Loop Invariant [2018-10-04 09:46:41,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-10-04 09:46:41,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:41,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 14.9s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-46-41-474.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-46-41-474.csv Received shutdown request...