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-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:27:46,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:46,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:46,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:46,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:46,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:46,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:46,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:46,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:46,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:46,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:46,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:46,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:46,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:46,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:46,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:46,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:46,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:46,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:46,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:46,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:46,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:46,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:46,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:46,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:46,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:46,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:46,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:46,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:46,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:46,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:46,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:46,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:46,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:46,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:46,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:46,747 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 10:27:46,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:46,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:46,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:46,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:46,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:46,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:46,766 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:46,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:46,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:46,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:46,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:46,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:46,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:46,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:46,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:46,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:46,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:46,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:46,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:46,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:46,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:46,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:46,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:46,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:46,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:46,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:46,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:46,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:46,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:46,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:46,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:46,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:46,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:46,855 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:46,855 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:46,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:27:46,856 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 10:27:46,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:46,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:46,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:46,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:46,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:46,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:46,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:46,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:46,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:46,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:46,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:47,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/1) ... [2018-09-30 10:27:47,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:47,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:47,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:47,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:47,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (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 10:27:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:47,850 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:47,851 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:47 BoogieIcfgContainer [2018-09-30 10:27:47,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:47,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:47,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:47,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:47,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:46" (1/2) ... [2018-09-30 10:27:47,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f9f19 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:27:47, skipping insertion in model container [2018-09-30 10:27:47,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:47" (2/2) ... [2018-09-30 10:27:47,858 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:27:47,867 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:47,875 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:47,927 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:47,928 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:47,928 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:47,929 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:47,929 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:47,929 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:47,929 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:47,929 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:47,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-30 10:27:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:47,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:47,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:47,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:47,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-30 10:27:47,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:47,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:48,222 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 10:27:48,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:48,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:48,252 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-30 10:27:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:48,324 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-30 10:27:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:48,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:27:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:48,337 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:27:48,337 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:27:48,341 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 10:27:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:27:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-30 10:27:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:27:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-30 10:27:48,383 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-30 10:27:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:48,384 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-30 10:27:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-30 10:27:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:48,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:48,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:48,385 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:48,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-30 10:27:48,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:48,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:48,502 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 10:27:48,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:48,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:48,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:48,505 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-30 10:27:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:48,548 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-30 10:27:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:48,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:27:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:48,558 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:27:48,559 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 10:27:48,562 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 10:27:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 10:27:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-30 10:27:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:27:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-30 10:27:48,594 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-30 10:27:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:48,596 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-30 10:27:48,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-30 10:27:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:48,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:48,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:48,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:48,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-30 10:27:48,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:48,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:48,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:48,712 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 10:27:48,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:48,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:48,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:48,714 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-30 10:27:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:48,786 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-30 10:27:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:48,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:27:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:48,795 INFO L225 Difference]: With dead ends: 175 [2018-09-30 10:27:48,795 INFO L226 Difference]: Without dead ends: 117 [2018-09-30 10:27:48,796 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 10:27:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-30 10:27:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-30 10:27:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 10:27:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-30 10:27:48,834 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-30 10:27:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:48,835 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-30 10:27:48,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-30 10:27:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:48,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:48,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:48,837 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:48,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-30 10:27:48,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:48,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:48,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:48,956 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 10:27:48,957 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:48,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:48,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:48,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:48,960 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-30 10:27:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:49,035 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-30 10:27:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:49,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:27:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:49,039 INFO L225 Difference]: With dead ends: 343 [2018-09-30 10:27:49,039 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 10:27:49,040 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 10:27:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 10:27:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-30 10:27:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 10:27:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-30 10:27:49,091 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-30 10:27:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:49,091 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-30 10:27:49,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-30 10:27:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:49,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:49,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:49,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:49,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-30 10:27:49,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:49,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:49,200 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 10:27:49,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:49,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:49,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:49,202 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-30 10:27:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:49,298 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-30 10:27:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:49,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:27:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:49,302 INFO L225 Difference]: With dead ends: 569 [2018-09-30 10:27:49,303 INFO L226 Difference]: Without dead ends: 343 [2018-09-30 10:27:49,304 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 10:27:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-30 10:27:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-30 10:27:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-30 10:27:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-30 10:27:49,365 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-30 10:27:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-30 10:27:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-30 10:27:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:49,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:49,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:49,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:49,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-30 10:27:49,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:49,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:49,608 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 10:27:49,609 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:49,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:49,610 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-30 10:27:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:49,837 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-30 10:27:49,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:49,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-30 10:27:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:49,841 INFO L225 Difference]: With dead ends: 610 [2018-09-30 10:27:49,841 INFO L226 Difference]: Without dead ends: 608 [2018-09-30 10:27:49,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-30 10:27:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-30 10:27:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-30 10:27:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-30 10:27:49,912 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-30 10:27:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:49,913 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-30 10:27:49,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-30 10:27:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:27:49,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:49,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:49,915 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:49,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-30 10:27:49,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:49,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:50,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:50,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:50,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:50,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:50,055 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-30 10:27:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:50,244 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-30 10:27:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:50,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:27:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:50,250 INFO L225 Difference]: With dead ends: 1113 [2018-09-30 10:27:50,250 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 10:27:50,252 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 10:27:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 10:27:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-30 10:27:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-30 10:27:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-30 10:27:50,379 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-30 10:27:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-30 10:27:50,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-30 10:27:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:27:50,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:50,383 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:50,384 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:50,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-30 10:27:50,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:50,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:50,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:50,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:50,739 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:50,739 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 10:27:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:50,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:27:51,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:51,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:27:51,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:27:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:27:51,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:51,276 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-30 10:27:51,532 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 10:27:52,607 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 10:27:53,978 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 10:27:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:54,154 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-30 10:27:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:27:54,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-30 10:27:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:54,163 INFO L225 Difference]: With dead ends: 2109 [2018-09-30 10:27:54,163 INFO L226 Difference]: Without dead ends: 1371 [2018-09-30 10:27:54,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:27:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-30 10:27:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-30 10:27:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 10:27:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-30 10:27:54,412 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-30 10:27:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:54,412 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-30 10:27:54,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:27:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-30 10:27:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:27:54,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:54,416 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:27:54,416 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:54,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-30 10:27:54,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:54,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 10:27:54,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:54,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:54,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:54,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:54,535 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-30 10:27:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:54,821 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-30 10:27:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:54,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 10:27:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:54,827 INFO L225 Difference]: With dead ends: 2161 [2018-09-30 10:27:54,827 INFO L226 Difference]: Without dead ends: 975 [2018-09-30 10:27:54,829 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 10:27:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-30 10:27:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-30 10:27:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-30 10:27:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-30 10:27:54,986 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-30 10:27:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:54,987 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-30 10:27:54,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-30 10:27:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:27:54,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:54,989 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:27:54,989 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:54,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-30 10:27:54,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:54,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-30 10:27:55,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:55,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:55,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:55,071 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-30 10:27:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:55,092 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-30 10:27:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:55,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 10:27:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:55,093 INFO L225 Difference]: With dead ends: 799 [2018-09-30 10:27:55,093 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:27:55,094 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 10:27:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:27:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:27:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:27:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:27:55,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-30 10:27:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:55,095 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:27:55,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:27:55,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:27:55,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:27:55,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:55,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:57,805 WARN L178 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 10:27:57,911 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 10:27:58,353 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:58,854 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 10:27:59,164 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 10:27:59,360 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 10:27:59,471 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 10:27:59,678 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 10:27:59,825 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:00,097 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 10:28:00,361 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 10:28:00,463 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 10:28:00,574 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 10:28:00,577 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 10:28:00,577 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:28:00,577 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:28:00,577 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-30 10:28:00,578 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 10:28:00,578 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:28:00,578 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:28:00,578 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 10:28:00,578 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 10:28:00,578 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-30 10:28:00,578 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:28:00,578 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:28:00,579 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:28:00,580 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-30 10:28:00,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,590 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,596 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,597 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,602 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,602 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,608 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,609 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,618 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,619 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,621 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,621 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,622 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,623 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,624 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,625 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,629 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,630 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,636 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,636 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,639 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:00 BoogieIcfgContainer [2018-09-30 10:28:00,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:00,642 INFO L168 Benchmark]: Toolchain (without parser) took 13706.06 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -124.8 MB). Peak memory consumption was 599.2 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:00,644 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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 10:28:00,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.79 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 10:28:00,645 INFO L168 Benchmark]: Boogie Preprocessor took 61.98 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 10:28:00,645 INFO L168 Benchmark]: RCFGBuilder took 797.14 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:00,646 INFO L168 Benchmark]: TraceAbstraction took 12787.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -156.5 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:00,650 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.22 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 51.79 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 61.98 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 797.14 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12787.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -156.5 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 398]: Loop Invariant [2018-09-30 10:28:00,661 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,661 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,662 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-30 10:28:00,664 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,664 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,665 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,666 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-30 10:28:00,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,669 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,669 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-30 10:28:00,671 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,672 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,673 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,673 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-30 10:28:00,674 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,675 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,675 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,676 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-30 10:28:00,677 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,677 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-09-30 10:28:00,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-30 10:28:00,682 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,682 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,683 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:00,683 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-00-690.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-00-690.csv Received shutdown request...