java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:52:19,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:52:19,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:52:19,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:52:19,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:52:19,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:52:19,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:52:19,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:52:19,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:52:19,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:52:19,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:52:19,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:52:19,837 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:52:19,838 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:52:19,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:52:19,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:52:19,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:52:19,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:52:19,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:52:19,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:52:19,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:52:19,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:52:19,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:52:19,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:52:19,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:52:19,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:52:19,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:52:19,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:52:19,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:52:19,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:52:19,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:52:19,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:52:19,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:52:19,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:52:19,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:52:19,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:52:19,888 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:52:19,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:52:19,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:52:19,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:52:19,918 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:52:19,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:52:19,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:52:19,919 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:52:19,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:52:19,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:52:19,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:52:19,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:52:19,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:52:19,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:52:19,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:52:19,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:52:19,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:52:19,922 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:52:19,922 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:52:19,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:52:19,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:52:19,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:52:19,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:52:19,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:19,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:52:19,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:52:19,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:52:19,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:52:19,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:52:19,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:52:19,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:52:19,924 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:52:19,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:52:19,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:52:19,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:52:19,987 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:52:19,988 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:52:19,989 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 12:52:19,989 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 12:52:20,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:52:20,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:52:20,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:20,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:52:20,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:52:20,122 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,143 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:20,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:52:20,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:52:20,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:52:20,166 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,167 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,171 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,171 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,191 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,196 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,203 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 12:52:20" (1/1) ... [2018-10-04 12:52:20,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:52:20,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:52:20,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:52:20,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:52:20,218 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 12:52:20" (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 12:52:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:52:20,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:52:21,021 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:52:21,022 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 12:52:21 BoogieIcfgContainer [2018-10-04 12:52:21,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:52:21,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:52:21,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:52:21,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:52:21,027 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 12:52:20" (1/2) ... [2018-10-04 12:52:21,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a060fa 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 12:52:21, skipping insertion in model container [2018-10-04 12:52:21,028 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 12:52:21" (2/2) ... [2018-10-04 12:52:21,030 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:52:21,040 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:52:21,049 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:52:21,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:52:21,105 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:52:21,105 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:52:21,105 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:52:21,105 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:52:21,106 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:52:21,106 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:52:21,106 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:52:21,106 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:52:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:52:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:21,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:21,137 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 12:52:21,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:21,145 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 12:52:21,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:21,486 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 12:52:21,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:21,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:21,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:21,512 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:21,515 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 12:52:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:21,587 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 12:52:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:21,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:21,602 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:52:21,603 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:52:21,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:52:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 12:52:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:52:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:52:21,647 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 12:52:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:21,648 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:52:21,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:52:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:21,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:21,649 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 12:52:21,650 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:21,650 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 12:52:21,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:21,835 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 12:52:21,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:21,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:21,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:21,840 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:52:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:21,881 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 12:52:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:21,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:21,884 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:52:21,884 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:52:21,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:52:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 12:52:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:52:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 12:52:21,905 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 12:52:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:21,906 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 12:52:21,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 12:52:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:21,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:21,908 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 12:52:21,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:21,908 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:21,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 12:52:21,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:21,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:22,148 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 12:52:22,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:22,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:52:22,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:52:22,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:52:22,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:22,150 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 12:52:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:22,344 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 12:52:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:52:22,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 12:52:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:22,356 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:52:22,356 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:52:22,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:52:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:52:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 12:52:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:52:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 12:52:22,412 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 12:52:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:22,416 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 12:52:22,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:52:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 12:52:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:22,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:22,418 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 12:52:22,418 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:22,418 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 12:52:22,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:22,553 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 12:52:22,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:22,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:22,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:22,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:22,555 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 12:52:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:22,634 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 12:52:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:22,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:22,640 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:52:22,640 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:52:22,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:52:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 12:52:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:52:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 12:52:22,677 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 12:52:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:22,677 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 12:52:22,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 12:52:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:22,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:22,680 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 12:52:22,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:22,681 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 12:52:22,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:22,811 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 12:52:22,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:22,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:22,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:22,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:22,815 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 12:52:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:22,880 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 12:52:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:22,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:22,883 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:52:22,883 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:52:22,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:52:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 12:52:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:52:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 12:52:22,929 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 12:52:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:22,930 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 12:52:22,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 12:52:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:22,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:22,932 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 12:52:22,932 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:22,933 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 12:52:22,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:22,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:23,062 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 12:52:23,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:23,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:23,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:23,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:23,065 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 12:52:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:23,196 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 12:52:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:23,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:23,199 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:52:23,200 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 12:52:23,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 12:52:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 12:52:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 12:52:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 12:52:23,274 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 12:52:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:23,274 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 12:52:23,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 12:52:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:23,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:23,278 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 12:52:23,278 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:23,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 12:52:23,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:23,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:23,399 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 12:52:23,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:23,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:23,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:23,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:23,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:23,401 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 12:52:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:23,609 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 12:52:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:23,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:23,615 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 12:52:23,615 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 12:52:23,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 12:52:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 12:52:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 12:52:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 12:52:23,756 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 12:52:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:23,757 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 12:52:23,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 12:52:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:23,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:23,764 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 12:52:23,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:23,765 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 12:52:23,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:23,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:23,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:23,889 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 12:52:23,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:23,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:23,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:23,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:23,891 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 12:52:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:24,233 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 12:52:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:24,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:24,243 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 12:52:24,244 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 12:52:24,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 12:52:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 12:52:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 12:52:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 12:52:24,523 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 12:52:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:24,524 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 12:52:24,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 12:52:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:24,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:24,528 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 12:52:24,529 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:24,531 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 12:52:24,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:24,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:24,886 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 12:52:24,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:52:24,886 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 12:52:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:25,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:52:26,038 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 12:52:26,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:52:26,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:52:26,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:52:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:52:26,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:26,077 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 12:52:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:30,148 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 12:52:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:52:30,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 12:52:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:30,165 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 12:52:30,166 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 12:52:30,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.0s impTime 13 [2018-10-04 12:52:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 12:52:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 12:52:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 12:52:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 12:52:30,580 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 12:52:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:30,580 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 12:52:30,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:52:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 12:52:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:52:30,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:30,585 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 12:52:30,585 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:30,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 12:52:30,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:30,727 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 12:52:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:30,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:30,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:30,728 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 12:52:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:31,383 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 12:52:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:31,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:52:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:31,394 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 12:52:31,395 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 12:52:31,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 12:52:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 12:52:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 12:52:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 12:52:31,822 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 12:52:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:31,823 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 12:52:31,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 12:52:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:52:31,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:31,826 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 12:52:31,827 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:31,827 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 12:52:31,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:31,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:31,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:52:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:31,923 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 12:52:31,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:31,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:31,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:31,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:31,925 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 12:52:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:31,967 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 12:52:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:31,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:52:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:31,968 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 12:52:31,968 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:52:31,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:52:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:52:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:52:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:52:31,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 12:52:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:31,971 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:52:31,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:52:31,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:52:31,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:52:32,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,118 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 12:52:32,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,384 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:52:32,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,553 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 12:52:32,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:32,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,081 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:52:33,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:33,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:34,377 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:52:35,788 WARN L178 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:36,302 WARN L178 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:36,536 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:37,330 WARN L178 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:52:37,447 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:37,559 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:52:37,683 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 12:52:37,831 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:37,959 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:38,075 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-04 12:52:38,205 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:38,392 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:52:38,658 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:38,660 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 12:52:38,661 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 12:52:38,661 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 12:52:38,661 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 12:52:38,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:38,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:38,661 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 12:52:38,661 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 12:52:38,662 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 12:52:38,662 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 12:52:38,662 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 12:52:38,662 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:38,662 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 12:52:38,662 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 12:52:38,662 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 12:52:38,663 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 12:52:38,663 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 12:52:38,663 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 12:52:38,663 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 12:52:38,664 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 12:52:38,664 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 12:52:38,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,687 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,687 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,696 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,696 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,700 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,708 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,712 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,712 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,717 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 12:52:38 BoogieIcfgContainer [2018-10-04 12:52:38,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:52:38,718 INFO L168 Benchmark]: Toolchain (without parser) took 18620.23 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 392.2 MB). Peak memory consumption was 661.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:38,719 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:38,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:38,720 INFO L168 Benchmark]: Boogie Preprocessor took 59.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:38,721 INFO L168 Benchmark]: RCFGBuilder took 805.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:38,722 INFO L168 Benchmark]: TraceAbstraction took 17693.88 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 339.3 MB). Peak memory consumption was 608.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:38,726 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 805.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17693.88 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 339.3 MB). Peak memory consumption was 608.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 12:52:38,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,739 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 12:52:38,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,741 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 12:52:38,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,743 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 12:52:38,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,745 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 12:52:38,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,747 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 12:52:38,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,750 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 12:52:38,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,752 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 12:52:38,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,754 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 12:52:38,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,756 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 12:52:38,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:38,758 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, 17.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.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.5s 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, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-52-38-765.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_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-52-38-765.csv Received shutdown request...