java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:56,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:56,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:56,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:56,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:56,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:56,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:56,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:56,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:56,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:56,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:56,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:56,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:56,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:56,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:56,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:56,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:56,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:56,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:56,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:56,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:56,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:57,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:57,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:57,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:57,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:57,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:57,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:57,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:57,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:57,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:57,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:57,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:57,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:57,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:57,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:57,012 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:21:57,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:57,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:57,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:57,045 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:57,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:57,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:57,046 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:57,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:57,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:57,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:57,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:57,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:57,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:57,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:57,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:57,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:57,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:57,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:57,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:57,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:57,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:57,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:57,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:57,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:57,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:57,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:57,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:57,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:57,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:57,053 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:57,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:57,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:57,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:57,129 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:57,130 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:57,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl [2018-10-04 09:21:57,131 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl' [2018-10-04 09:21:57,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:57,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:57,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:57,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:57,220 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:57,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:57,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:57,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:57,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:57,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/1) ... [2018-10-04 09:21:57,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:57,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:57,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:57,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:57,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (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:21:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:57,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:58,113 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:58,114 INFO L202 PluginConnector]: Adding new model pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:58 BoogieIcfgContainer [2018-10-04 09:21:58,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:58,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:58,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:58,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:58,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:57" (1/2) ... [2018-10-04 09:21:58,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de953b5 and model type pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:58, skipping insertion in model container [2018-10-04 09:21:58,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:58" (2/2) ... [2018-10-04 09:21:58,121 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl [2018-10-04 09:21:58,131 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:58,138 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:58,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:58,186 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:58,186 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:58,186 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:58,186 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:58,186 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:58,187 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:58,187 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:58,187 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 09:21:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:21:58,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:58,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-10-04 09:21:58,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,477 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:21:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,503 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-04 09:21:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,589 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-10-04 09:21:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 09:21:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,606 INFO L225 Difference]: With dead ends: 60 [2018-10-04 09:21:58,607 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:21:58,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:21:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-04 09:21:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:21:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-10-04 09:21:58,653 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-10-04 09:21:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,654 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-10-04 09:21:58,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-10-04 09:21:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:21:58,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:58,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-10-04 09:21:58,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,805 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:21:58,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:58,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,808 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-10-04 09:21:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,863 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-10-04 09:21:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 09:21:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,866 INFO L225 Difference]: With dead ends: 109 [2018-10-04 09:21:58,866 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 09:21:58,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 09:21:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-04 09:21:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 09:21:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-10-04 09:21:58,890 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-10-04 09:21:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,890 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-10-04 09:21:58,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-10-04 09:21:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:21:58,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:58,893 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-10-04 09:21:58,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:59,079 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:21:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:59,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:59,082 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-10-04 09:21:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:59,134 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-10-04 09:21:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 09:21:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:59,139 INFO L225 Difference]: With dead ends: 211 [2018-10-04 09:21:59,139 INFO L226 Difference]: Without dead ends: 141 [2018-10-04 09:21:59,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-04 09:21:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-04 09:21:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 09:21:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-10-04 09:21:59,186 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-10-04 09:21:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:59,191 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-10-04 09:21:59,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-10-04 09:21:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:21:59,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:59,193 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:59,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:59,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-10-04 09:21:59,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:59,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:59,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:59,320 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:21:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:59,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:59,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:59,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:59,322 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-10-04 09:21:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:59,464 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-10-04 09:21:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:59,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 09:21:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:59,473 INFO L225 Difference]: With dead ends: 349 [2018-10-04 09:21:59,474 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 09:21:59,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 09:21:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-04 09:21:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-04 09:21:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-10-04 09:21:59,535 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-10-04 09:21:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:59,537 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-10-04 09:21:59,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-10-04 09:21:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:21:59,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:59,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:59,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:59,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-10-04 09:21:59,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:59,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:59,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:59,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:59,726 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:21:59,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:59,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:59,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:59,728 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-10-04 09:21:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:59,874 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-10-04 09:21:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:59,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-04 09:21:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:59,880 INFO L225 Difference]: With dead ends: 377 [2018-10-04 09:21:59,880 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 09:21:59,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 09:21:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-10-04 09:21:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 09:21:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-10-04 09:21:59,951 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-10-04 09:21:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:59,952 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-10-04 09:21:59,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-10-04 09:21:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:21:59,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:59,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:59,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:59,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-10-04 09:21:59,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:00,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:00,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:00,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:00,153 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-10-04 09:22:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:00,291 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-10-04 09:22:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:00,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:22:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:00,296 INFO L225 Difference]: With dead ends: 669 [2018-10-04 09:22:00,296 INFO L226 Difference]: Without dead ends: 447 [2018-10-04 09:22:00,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-04 09:22:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-10-04 09:22:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-04 09:22:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-10-04 09:22:00,378 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-10-04 09:22:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:00,378 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-10-04 09:22:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-10-04 09:22:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:22:00,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:00,383 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:00,384 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:00,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-10-04 09:22:00,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:00,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:00,549 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-10-04 09:22:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:00,759 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-10-04 09:22:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:00,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:22:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:00,765 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 09:22:00,765 INFO L226 Difference]: Without dead ends: 887 [2018-10-04 09:22:00,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-04 09:22:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-10-04 09:22:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-10-04 09:22:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-10-04 09:22:00,915 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-10-04 09:22:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:00,916 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-10-04 09:22:00,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-10-04 09:22:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:22:00,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:00,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:00,920 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:00,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-10-04 09:22:00,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:01,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:01,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:01,083 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-10-04 09:22:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:01,446 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-10-04 09:22:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:01,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:22:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:01,456 INFO L225 Difference]: With dead ends: 2649 [2018-10-04 09:22:01,457 INFO L226 Difference]: Without dead ends: 1767 [2018-10-04 09:22:01,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-10-04 09:22:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-10-04 09:22:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-04 09:22:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-10-04 09:22:01,760 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-10-04 09:22:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:01,761 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-10-04 09:22:01,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-10-04 09:22:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:22:01,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:01,765 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:01,765 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-10-04 09:22:01,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:01,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:02,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:02,033 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:22:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:02,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:22:02,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:02,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:22:02,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:22:02,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:22:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:22:02,463 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-10-04 09:22:02,687 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 09:22:03,199 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:22:03,509 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:22:05,609 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-04 09:22:06,999 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 09:22:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:07,275 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-10-04 09:22:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:22:07,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-04 09:22:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:07,284 INFO L225 Difference]: With dead ends: 4087 [2018-10-04 09:22:07,284 INFO L226 Difference]: Without dead ends: 1617 [2018-10-04 09:22:07,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:22:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-10-04 09:22:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-10-04 09:22:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-10-04 09:22:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-10-04 09:22:07,526 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-10-04 09:22:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:07,526 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-10-04 09:22:07,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:22:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-10-04 09:22:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 09:22:07,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:07,529 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:22:07,529 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:07,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-10-04 09:22:07,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:07,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-04 09:22:07,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:07,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:07,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:07,635 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-10-04 09:22:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:07,670 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-10-04 09:22:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:07,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-04 09:22:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:07,671 INFO L225 Difference]: With dead ends: 1464 [2018-10-04 09:22:07,671 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:07,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:07,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-10-04 09:22:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:07,674 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:07,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:07,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:07,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:07,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:07,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:07,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:07,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:07,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:08,150 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 66 [2018-10-04 09:22:08,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:08,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:08,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:08,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:08,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:09,352 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 09:22:09,576 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 09:22:10,360 WARN L178 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:22:10,687 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-10-04 09:22:10,862 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 09:22:11,193 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-10-04 09:22:11,879 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-10-04 09:22:12,300 WARN L178 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-10-04 09:22:12,575 INFO L421 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 09:22:12,575 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,576 INFO L421 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 09:22:12,576 INFO L421 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse8 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse9 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and (and .cse8 .cse0 .cse2 .cse3 .cse9 .cse4) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse8 .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse2 .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse9 .cse4 .cse5))) [2018-10-04 09:22:12,576 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-04 09:22:12,576 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-10-04 09:22:12,576 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-10-04 09:22:12,576 INFO L421 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~133) (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:12,577 INFO L421 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse8 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse9 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and (and .cse8 .cse0 .cse2 .cse3 .cse9 .cse4) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse8 .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse2 .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse9 .cse4 .cse5))) [2018-10-04 09:22:12,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-10-04 09:22:12,577 INFO L421 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse1 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse8 .cse6 .cse7))) [2018-10-04 09:22:12,577 INFO L421 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,577 INFO L421 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 09:22:12,577 INFO L421 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 09:22:12,578 INFO L421 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse1 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse8 .cse6 .cse7))) [2018-10-04 09:22:12,578 INFO L421 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,578 INFO L421 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~133) (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:12,578 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-04 09:22:12,579 INFO L421 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 09:22:12,579 INFO L421 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,579 INFO L421 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,579 INFO L421 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:12,586 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,596 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,596 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,597 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,606 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,606 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,609 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,609 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,613 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,614 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,615 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,634 INFO L202 PluginConnector]: Adding new model pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:12 BoogieIcfgContainer [2018-10-04 09:22:12,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:12,636 INFO L168 Benchmark]: Toolchain (without parser) took 15417.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -7.8 MB). Peak memory consumption was 617.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:12,637 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:12,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:12,638 INFO L168 Benchmark]: Boogie Preprocessor took 63.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:12,638 INFO L168 Benchmark]: RCFGBuilder took 774.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:12,639 INFO L168 Benchmark]: TraceAbstraction took 14519.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -50.1 MB). Peak memory consumption was 575.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:12,643 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 774.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14519.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -50.1 MB). Peak memory consumption was 575.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 480]: Loop Invariant [2018-10-04 09:22:12,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: (((((((assert_~arg <= 1 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant [2018-10-04 09:22:12,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant [2018-10-04 09:22:12,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3)) || ((((((((((assert_~arg <= 1 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 396]: Loop Invariant [2018-10-04 09:22:12,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((assert_~arg <= 1 && 1 <= check_~tmp~133) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant [2018-10-04 09:22:12,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant [2018-10-04 09:22:12,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant [2018-10-04 09:22:12,669 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3)) || ((((((((((assert_~arg <= 1 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 383]: Loop Invariant [2018-10-04 09:22:12,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((assert_~arg <= 1 && 1 <= check_~tmp~133) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant [2018-10-04 09:22:12,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:22:12,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((1 <= check_~tmp~133 && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 14.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1425 HoareAnnotationTreeSize, 18 FomulaSimplifications, 42972 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 591 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 334 ConstructedInterpolants, 12 QuantifiedInterpolants, 42553 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 167/187 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.6.1.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-12-681.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-12-681.csv Received shutdown request...