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-1cc990c [2018-09-30 23:42:01,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:42:01,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:42:01,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:42:01,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:42:01,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:42:01,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:42:01,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:42:01,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:42:01,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:42:01,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:42:01,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:42:01,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:42:01,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:42:01,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:42:01,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:42:01,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:42:01,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:42:01,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:42:01,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:42:01,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:42:01,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:42:01,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:42:01,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:42:01,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:42:01,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:42:01,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:42:01,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:42:01,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:42:01,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:42:01,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:42:01,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:42:01,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:42:01,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:42:01,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:42:01,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:42:01,735 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-09-30 23:42:01,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:42:01,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:42:01,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:42:01,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:42:01,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:42:01,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:42:01,767 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:42:01,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:42:01,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:42:01,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:42:01,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:42:01,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:42:01,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:42:01,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:42:01,769 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:42:01,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:42:01,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:42:01,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:42:01,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:42:01,770 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:42:01,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:42:01,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:42:01,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:42:01,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:42:01,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:42:01,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:42:01,773 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:42:01,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:42:01,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:42:01,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:42:01,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:42:01,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:42:01,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:42:01,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:42:01,862 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:42:01,863 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-09-30 23:42:01,864 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-09-30 23:42:01,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:42:01,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:42:01,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:42:01,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:42:01,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:42:01,988 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,009 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:42:02,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:42:02,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:42:02,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:42:02,037 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,037 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,040 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,041 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,061 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,067 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,074 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 30.09 11:42:01" (1/1) ... [2018-09-30 23:42:02,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:42:02,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:42:02,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:42:02,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:42:02,088 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 30.09 11:42:01" (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-09-30 23:42:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:42:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:42:02,863 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:42:02,864 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 30.09 11:42:02 BoogieIcfgContainer [2018-09-30 23:42:02,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:42:02,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:42:02,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:42:02,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:42:02,869 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 30.09 11:42:01" (1/2) ... [2018-09-30 23:42:02,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a0fbde and model type pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:42:02, skipping insertion in model container [2018-09-30 23:42:02,870 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 30.09 11:42:02" (2/2) ... [2018-09-30 23:42:02,872 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl [2018-09-30 23:42:02,882 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:42:02,892 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:42:02,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:42:02,949 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:42:02,949 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:42:02,949 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:42:02,949 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:42:02,950 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:42:02,950 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:42:02,950 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:42:02,950 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:42:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-30 23:42:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:02,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:02,985 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-09-30 23:42:02,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:02,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-09-30 23:42:02,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:02,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:03,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:03,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:03,320 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-09-30 23:42:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:03,404 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-09-30 23:42:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:03,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:03,418 INFO L225 Difference]: With dead ends: 60 [2018-09-30 23:42:03,418 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 23:42:03,422 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-09-30 23:42:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 23:42:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-09-30 23:42:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 23:42:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-09-30 23:42:03,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-09-30 23:42:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:03,469 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-09-30 23:42:03,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-09-30 23:42:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:03,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:03,471 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-09-30 23:42:03,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:03,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-09-30 23:42:03,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:03,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:03,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:03,679 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:03,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:03,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:03,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:03,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:03,682 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-09-30 23:42:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:03,746 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-09-30 23:42:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:03,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:03,751 INFO L225 Difference]: With dead ends: 109 [2018-09-30 23:42:03,751 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 23:42:03,754 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-09-30 23:42:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 23:42:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-09-30 23:42:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 23:42:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-09-30 23:42:03,790 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-09-30 23:42:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:03,790 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-09-30 23:42:03,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-09-30 23:42:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:03,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:03,792 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-09-30 23:42:03,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:03,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-09-30 23:42:03,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:03,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:03,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:03,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:03,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:03,920 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-09-30 23:42:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:03,990 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-09-30 23:42:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:03,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:03,995 INFO L225 Difference]: With dead ends: 211 [2018-09-30 23:42:03,995 INFO L226 Difference]: Without dead ends: 141 [2018-09-30 23:42:03,996 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-09-30 23:42:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-30 23:42:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-09-30 23:42:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-30 23:42:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-09-30 23:42:04,040 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-09-30 23:42:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:04,041 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-09-30 23:42:04,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-09-30 23:42:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:04,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:04,045 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-09-30 23:42:04,046 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:04,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-09-30 23:42:04,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:04,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:04,218 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:04,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:04,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:04,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:04,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:04,220 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-09-30 23:42:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:04,365 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-09-30 23:42:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:04,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:04,375 INFO L225 Difference]: With dead ends: 349 [2018-09-30 23:42:04,376 INFO L226 Difference]: Without dead ends: 211 [2018-09-30 23:42:04,377 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-09-30 23:42:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-30 23:42:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-09-30 23:42:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-30 23:42:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-09-30 23:42:04,452 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-09-30 23:42:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-09-30 23:42:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-09-30 23:42:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:04,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:04,454 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-09-30 23:42:04,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:04,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-09-30 23:42:04,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:04,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:04,742 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:04,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:42:04,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:42:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:42:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:42:04,744 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-09-30 23:42:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:04,948 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-09-30 23:42:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:42:04,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-09-30 23:42:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:04,955 INFO L225 Difference]: With dead ends: 377 [2018-09-30 23:42:04,955 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 23:42:04,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:42:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 23:42:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-09-30 23:42:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 23:42:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-09-30 23:42:05,010 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-09-30 23:42:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:05,010 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-09-30 23:42:05,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:42:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-09-30 23:42:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:05,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:05,013 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-09-30 23:42:05,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:05,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-09-30 23:42:05,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:05,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:05,199 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:05,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:05,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:05,201 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-09-30 23:42:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:05,334 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-09-30 23:42:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:05,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:05,338 INFO L225 Difference]: With dead ends: 669 [2018-09-30 23:42:05,338 INFO L226 Difference]: Without dead ends: 447 [2018-09-30 23:42:05,340 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-09-30 23:42:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-30 23:42:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-09-30 23:42:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 23:42:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-09-30 23:42:05,425 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-09-30 23:42:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:05,425 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-09-30 23:42:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-09-30 23:42:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:05,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:05,429 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-09-30 23:42:05,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:05,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-09-30 23:42:05,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:05,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:05,591 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:05,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:05,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:05,592 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-09-30 23:42:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:05,812 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-09-30 23:42:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:05,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:05,820 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 23:42:05,821 INFO L226 Difference]: Without dead ends: 887 [2018-09-30 23:42:05,822 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-09-30 23:42:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-09-30 23:42:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-09-30 23:42:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-09-30 23:42:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-09-30 23:42:05,978 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-09-30 23:42:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-09-30 23:42:05,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-09-30 23:42:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:05,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:05,989 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-09-30 23:42:05,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:05,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-09-30 23:42:05,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:05,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:05,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:05,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:06,166 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:06,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:06,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:06,167 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-09-30 23:42:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:06,539 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-09-30 23:42:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:06,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:06,549 INFO L225 Difference]: With dead ends: 2649 [2018-09-30 23:42:06,549 INFO L226 Difference]: Without dead ends: 1767 [2018-09-30 23:42:06,551 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-09-30 23:42:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-09-30 23:42:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-09-30 23:42:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-09-30 23:42:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-09-30 23:42:06,871 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-09-30 23:42:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:06,872 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-09-30 23:42:06,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-09-30 23:42:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:06,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:06,875 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-09-30 23:42:06,875 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:06,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-09-30 23:42:06,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:06,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:06,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:07,238 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:42:07,238 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-09-30 23:42:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:07,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:42:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:42:07,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:42:07,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 23:42:07,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:42:07,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:42:07,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:42:07,810 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-09-30 23:42:08,043 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 23:42:08,568 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:42:09,078 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:42:09,403 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 23:42:11,133 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 23:42:11,779 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 23:42:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:12,520 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-09-30 23:42:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:42:12,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-09-30 23:42:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:12,530 INFO L225 Difference]: With dead ends: 4087 [2018-09-30 23:42:12,531 INFO L226 Difference]: Without dead ends: 1617 [2018-09-30 23:42:12,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:42:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-09-30 23:42:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-09-30 23:42:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-09-30 23:42:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-09-30 23:42:12,766 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-09-30 23:42:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:12,766 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-09-30 23:42:12,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:42:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-09-30 23:42:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 23:42:12,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:12,769 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-09-30 23:42:12,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:12,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-09-30 23:42:12,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-30 23:42:12,861 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:12,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:12,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:12,862 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-09-30 23:42:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:12,896 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-09-30 23:42:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:12,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-09-30 23:42:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:12,897 INFO L225 Difference]: With dead ends: 1464 [2018-09-30 23:42:12,897 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:42:12,898 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-09-30 23:42:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:42:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:42:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:42:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:42:12,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-09-30 23:42:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:12,901 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:42:12,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:42:12,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:42:12,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:42:13,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,369 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 66 [2018-09-30 23:42:13,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:13,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:14,581 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-30 23:42:14,807 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 23:42:15,613 WARN L178 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:42:16,080 WARN L178 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-09-30 23:42:16,229 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-30 23:42:16,618 WARN L178 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-09-30 23:42:17,320 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-09-30 23:42:17,624 WARN L178 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-09-30 23:42:17,888 INFO L422 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-09-30 23:42:17,888 INFO L422 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-09-30 23:42:17,888 INFO L422 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-09-30 23:42:17,889 INFO L422 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-09-30 23:42:17,889 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-30 23:42:17,889 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:17,889 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:17,889 INFO L422 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-09-30 23:42:17,889 INFO L422 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-09-30 23:42:17,890 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:17,890 INFO L422 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-09-30 23:42:17,890 INFO L422 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-09-30 23:42:17,890 INFO L422 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-09-30 23:42:17,890 INFO L422 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-09-30 23:42:17,891 INFO L422 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-09-30 23:42:17,891 INFO L422 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-09-30 23:42:17,891 INFO L422 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-09-30 23:42:17,891 INFO L422 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-09-30 23:42:17,891 INFO L422 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-09-30 23:42:17,892 INFO L422 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-09-30 23:42:17,892 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-30 23:42:17,892 INFO L422 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-09-30 23:42:17,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,905 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,906 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,909 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,909 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,922 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,922 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,924 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,929 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,932 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,932 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,936 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,936 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,938 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,938 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,940 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,940 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,942 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,943 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,970 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 30.09 11:42:17 BoogieIcfgContainer [2018-09-30 23:42:17,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:42:17,971 INFO L168 Benchmark]: Toolchain (without parser) took 16005.53 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 142.1 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 6.8 MB). Peak memory consumption was 608.4 MB. Max. memory is 7.1 GB. [2018-09-30 23:42:17,974 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-09-30 23:42:17,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.97 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-09-30 23:42:17,975 INFO L168 Benchmark]: Boogie Preprocessor took 58.20 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-09-30 23:42:17,976 INFO L168 Benchmark]: RCFGBuilder took 780.04 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-09-30 23:42:17,977 INFO L168 Benchmark]: TraceAbstraction took 15105.15 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 142.1 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -35.5 MB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. [2018-09-30 23:42:17,984 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.21 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.97 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 58.20 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 780.04 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 15105.15 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 142.1 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -35.5 MB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_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-09-30 23:42:17,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,995 WARN L389 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-09-30 23:42:17,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,997 WARN L389 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-09-30 23:42:17,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:17,999 WARN L389 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-09-30 23:42:18,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,004 WARN L389 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-09-30 23:42:18,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,009 WARN L389 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-09-30 23:42:18,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,013 WARN L389 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-09-30 23:42:18,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,017 WARN L389 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-09-30 23:42:18,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,021 WARN L389 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-09-30 23:42:18,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:18,025 WARN L389 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.9s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.8s 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: 1.0s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s 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-09-30_23-42-18-033.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-09-30_23-42-18-033.csv Received shutdown request...