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.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:32,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:32,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:32,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:32,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:32,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:32,816 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:32,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:32,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:32,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:32,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:32,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:32,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:32,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:32,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:32,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:32,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:32,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:32,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:32,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:32,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:32,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:32,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:32,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:32,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:32,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:32,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:32,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:32,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:32,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:32,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:32,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:32,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:32,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:32,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:32,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:32,849 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:21:32,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:32,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:32,874 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:32,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:32,875 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:32,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:32,876 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:32,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:32,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:32,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:32,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:32,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:32,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:32,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:32,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:32,878 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:32,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:32,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:32,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:32,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:32,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:32,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:32,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:32,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:32,880 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:32,880 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:32,880 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:32,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:32,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:32,881 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:32,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:32,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:32,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:32,952 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:32,953 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:32,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:21:32,954 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 09:21:33,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:33,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:33,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:33,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:33,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:33,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:33,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:33,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:33,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:33,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... [2018-10-04 09:21:33,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:33,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:33,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:33,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:33,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:33,830 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:33,831 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:33 BoogieIcfgContainer [2018-10-04 09:21:33,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:33,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:33,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:33,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:33,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:33" (1/2) ... [2018-10-04 09:21:33,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7be2a8 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:33, skipping insertion in model container [2018-10-04 09:21:33,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:33" (2/2) ... [2018-10-04 09:21:33,838 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:21:33,848 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:33,857 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:33,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:33,908 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:33,908 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:33,909 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:33,909 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:33,909 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:33,909 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:33,909 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:33,909 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 09:21:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:21:33,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:33,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:33,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:33,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 09:21:33,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:33,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:34,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:34,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:34,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:34,257 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 09:21:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:34,336 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 09:21:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:34,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:21:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:34,353 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:21:34,353 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:21:34,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:21:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 09:21:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:21:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 09:21:34,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 09:21:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:34,403 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 09:21:34,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 09:21:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:21:34,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:34,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:34,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:34,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 09:21:34,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:34,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:34,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:34,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:34,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:34,603 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 09:21:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:34,640 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 09:21:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:34,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:21:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:34,645 INFO L225 Difference]: With dead ends: 103 [2018-10-04 09:21:34,645 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:21:34,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:21:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 09:21:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 09:21:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 09:21:34,683 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 09:21:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:34,686 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 09:21:34,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 09:21:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:21:34,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:34,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:34,689 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:34,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 09:21:34,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:34,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:34,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:34,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:34,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:34,861 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 09:21:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:34,990 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 09:21:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:34,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 09:21:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:34,995 INFO L225 Difference]: With dead ends: 141 [2018-10-04 09:21:34,995 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 09:21:34,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 09:21:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 09:21:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 09:21:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 09:21:35,024 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 09:21:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:35,024 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 09:21:35,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 09:21:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:21:35,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:35,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:35,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 09:21:35,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:35,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:35,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:35,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,154 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 09:21:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:35,254 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 09:21:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:35,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:21:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:35,259 INFO L225 Difference]: With dead ends: 183 [2018-10-04 09:21:35,259 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 09:21:35,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 09:21:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 09:21:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 09:21:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 09:21:35,312 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 09:21:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:35,313 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 09:21:35,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 09:21:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:21:35,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:35,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:35,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:35,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 09:21:35,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:35,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:35,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:35,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:35,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,407 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 09:21:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:35,534 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 09:21:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:35,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:21:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:35,536 INFO L225 Difference]: With dead ends: 321 [2018-10-04 09:21:35,537 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 09:21:35,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 09:21:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 09:21:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 09:21:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 09:21:35,612 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 09:21:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:35,612 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 09:21:35,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 09:21:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:21:35,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:35,615 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:35,615 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:35,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 09:21:35,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:35,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:35,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,736 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 09:21:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:35,849 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 09:21:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:35,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:21:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:35,854 INFO L225 Difference]: With dead ends: 633 [2018-10-04 09:21:35,854 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 09:21:35,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 09:21:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 09:21:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 09:21:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 09:21:35,949 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 09:21:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:35,949 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 09:21:35,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 09:21:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:21:35,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:35,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:35,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:35,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 09:21:35,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:36,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:36,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:36,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:36,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:36,098 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 09:21:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:36,282 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 09:21:36,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:36,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:21:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:36,288 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 09:21:36,288 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 09:21:36,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 09:21:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 09:21:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 09:21:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 09:21:36,417 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 09:21:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:36,417 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 09:21:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 09:21:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:21:36,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:36,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:36,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:36,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 09:21:36,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:36,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:36,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:36,544 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 09:21:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:36,846 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 09:21:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:36,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:21:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:36,857 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 09:21:36,857 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 09:21:36,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 09:21:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 09:21:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 09:21:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 09:21:37,094 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 09:21:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 09:21:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 09:21:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:21:37,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:37,098 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:37,098 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:37,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 09:21:37,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:37,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:37,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:37,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:37,288 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:21:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:37,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:37,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:37,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:21:37,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:21:37,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:21:37,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:21:37,774 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 09:21:38,746 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-04 09:21:39,116 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 09:21:40,714 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 09:21:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:41,128 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 09:21:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:21:41,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 09:21:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:41,144 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 09:21:41,144 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 09:21:41,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:21:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 09:21:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 09:21:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 09:21:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 09:21:41,546 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 09:21:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:41,546 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 09:21:41,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:21:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 09:21:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:21:41,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:41,551 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:41,551 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:41,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 09:21:41,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:41,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:41,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:21:41,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:41,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:41,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:41,649 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 09:21:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:42,153 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 09:21:42,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:42,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:21:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:42,164 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 09:21:42,164 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 09:21:42,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 09:21:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 09:21:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 09:21:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 09:21:42,519 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 09:21:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:42,520 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 09:21:42,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 09:21:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:21:42,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:42,523 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 09:21:42,523 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:42,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 09:21:42,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:42,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:21:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 09:21:42,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:42,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:42,608 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 09:21:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:42,645 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 09:21:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:42,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:21:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:42,646 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 09:21:42,646 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:21:42,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:21:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:21:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:21:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:21:42,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 09:21:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:42,650 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:21:42,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:21:42,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:21:42,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:21:42,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,812 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 09:21:42,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:42,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,098 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 09:21:43,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,341 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 40 [2018-10-04 09:21:43,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,764 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 09:21:43,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:43,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:45,084 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:21:46,252 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:46,554 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:46,757 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:47,121 WARN L178 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:21:47,270 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:47,384 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:21:47,572 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:47,694 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:47,818 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:47,965 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:21:48,231 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:48,235 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:21:48,235 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:48,235 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,236 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:21:48,236 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:21:48,236 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:21:48,236 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 09:21:48,236 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:48,236 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,236 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:21:48,237 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:48,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:21:48,237 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 09:21:48,237 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:48,237 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,238 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 09:21:48,238 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,238 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:21:48,238 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,238 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:48,251 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,252 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,255 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,255 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,257 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,258 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,259 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,260 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,262 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,262 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,264 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,265 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,268 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,268 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,270 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,270 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,275 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,276 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,279 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,279 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,283 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,285 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,286 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,302 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,302 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,304 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:21:48 BoogieIcfgContainer [2018-10-04 09:21:48,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:21:48,310 INFO L168 Benchmark]: Toolchain (without parser) took 15272.62 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 211.8 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 444.8 MB). Peak memory consumption was 656.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:48,311 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:48,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:48,312 INFO L168 Benchmark]: Boogie Preprocessor took 37.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:48,315 INFO L168 Benchmark]: RCFGBuilder took 707.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:48,315 INFO L168 Benchmark]: TraceAbstraction took 14477.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 211.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 402.5 MB). Peak memory consumption was 614.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:48,322 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.73 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 37.52 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 707.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14477.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 211.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 402.5 MB). Peak memory consumption was 614.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-04 09:21:48,335 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,335 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,336 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,336 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-04 09:21:48,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,342 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,342 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-04 09:21:48,343 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-10-04 09:21:48,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,347 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,347 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-04 09:21:48,348 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,348 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-10-04 09:21:48,351 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,351 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 09:21:48,353 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,354 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,354 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,355 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 09:21:48,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 09:21:48,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,359 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,359 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-04 09:21:48,360 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,360 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:48,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-21-48-367.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-21-48-367.csv Received shutdown request...