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-c372c2b [2018-10-02 12:15:33,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:15:33,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:15:33,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:15:33,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:15:33,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:15:33,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:15:33,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:15:33,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:15:33,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:15:33,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:15:33,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:15:33,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:15:33,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:15:33,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:15:33,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:15:33,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:15:33,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:15:33,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:15:33,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:15:33,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:15:33,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:15:33,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:15:33,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:15:33,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:15:33,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:15:33,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:15:33,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:15:33,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:15:33,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:15:33,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:15:33,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:15:33,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:15:33,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:15:33,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:15:33,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:15:33,065 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-02 12:15:33,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:15:33,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:15:33,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:15:33,088 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:15:33,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:15:33,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:15:33,089 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:15:33,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:15:33,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:15:33,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:15:33,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:15:33,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:15:33,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:15:33,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:15:33,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:15:33,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:15:33,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:15:33,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:15:33,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:15:33,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:15:33,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:15:33,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:15:33,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:15:33,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:15:33,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:15:33,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:15:33,093 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:15:33,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:15:33,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:15:33,094 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:15:33,094 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:15:33,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:15:33,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:15:33,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:15:33,163 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:15:33,163 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:15:33,164 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-02 12:15:33,165 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-02 12:15:33,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:15:33,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:15:33,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:33,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:15:33,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:15:33,280 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,308 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:33,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:15:33,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:15:33,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:15:33,338 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,338 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,344 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,345 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,355 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,358 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,361 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 02.10 12:15:33" (1/1) ... [2018-10-02 12:15:33,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:15:33,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:15:33,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:15:33,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:15:33,367 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 02.10 12:15:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:15:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:15:33,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:15:34,130 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:15:34,130 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 02.10 12:15:34 BoogieIcfgContainer [2018-10-02 12:15:34,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:15:34,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:15:34,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:15:34,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:15:34,136 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 02.10 12:15:33" (1/2) ... [2018-10-02 12:15:34,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69727c6 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:15:34, skipping insertion in model container [2018-10-02 12:15:34,137 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 02.10 12:15:34" (2/2) ... [2018-10-02 12:15:34,139 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 12:15:34,150 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:15:34,159 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:15:34,212 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:15:34,213 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:15:34,213 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:15:34,213 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:15:34,214 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:15:34,214 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:15:34,214 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:15:34,214 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:15:34,214 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:15:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 12:15:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:34,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:34,240 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-02 12:15:34,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:34,249 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-02 12:15:34,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:34,555 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-02 12:15:34,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:34,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:34,579 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:34,581 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-02 12:15:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:34,704 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-02 12:15:34,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:34,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:34,719 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:15:34,719 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 12:15:34,723 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 [2018-10-02 12:15:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 12:15:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-02 12:15:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:15:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-02 12:15:34,765 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-02 12:15:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:34,765 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-02 12:15:34,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-02 12:15:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:34,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:34,766 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-02 12:15:34,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:34,767 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-02 12:15:34,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:34,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:34,889 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-02 12:15:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:34,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:34,892 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:34,892 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-02 12:15:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:35,010 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-02 12:15:35,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:35,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:35,012 INFO L225 Difference]: With dead ends: 103 [2018-10-02 12:15:35,012 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 12:15:35,013 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 [2018-10-02 12:15:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 12:15:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-02 12:15:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 12:15:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-02 12:15:35,033 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-02 12:15:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:35,034 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-02 12:15:35,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-02 12:15:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:35,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:35,035 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-02 12:15:35,036 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:35,036 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-02 12:15:35,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:35,216 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-02 12:15:35,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:35,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:15:35,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:15:35,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:15:35,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:35,218 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-02 12:15:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:35,625 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-02 12:15:35,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:15:35,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-02 12:15:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:35,635 INFO L225 Difference]: With dead ends: 141 [2018-10-02 12:15:35,638 INFO L226 Difference]: Without dead ends: 139 [2018-10-02 12:15:35,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-02 12:15:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-02 12:15:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-02 12:15:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-02 12:15:35,687 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-02 12:15:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:35,689 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-02 12:15:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:15:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-02 12:15:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:35,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:35,691 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-02 12:15:35,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:35,693 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-02 12:15:35,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:35,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:35,823 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-02 12:15:35,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:35,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:35,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:35,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:35,825 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-02 12:15:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:35,926 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-02 12:15:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:35,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:35,928 INFO L225 Difference]: With dead ends: 183 [2018-10-02 12:15:35,929 INFO L226 Difference]: Without dead ends: 109 [2018-10-02 12:15:35,930 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 [2018-10-02 12:15:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-02 12:15:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-02 12:15:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 12:15:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-02 12:15:35,956 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-02 12:15:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-02 12:15:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-02 12:15:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:35,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:35,961 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-02 12:15:35,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:35,961 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-02 12:15:35,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:35,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:35,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:35,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:35,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:36,094 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-02 12:15:36,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:36,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:36,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:36,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:36,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:36,095 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-02 12:15:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:36,244 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-02 12:15:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:36,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:36,248 INFO L225 Difference]: With dead ends: 321 [2018-10-02 12:15:36,248 INFO L226 Difference]: Without dead ends: 215 [2018-10-02 12:15:36,249 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 [2018-10-02 12:15:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-02 12:15:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-02 12:15:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 12:15:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-02 12:15:36,295 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-02 12:15:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:36,295 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-02 12:15:36,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-02 12:15:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:36,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:36,298 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-02 12:15:36,298 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:36,298 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-02 12:15:36,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:36,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:36,459 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-02 12:15:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:36,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:36,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:36,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:36,462 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-02 12:15:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:36,693 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-02 12:15:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:36,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:36,701 INFO L225 Difference]: With dead ends: 633 [2018-10-02 12:15:36,701 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 12:15:36,705 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 [2018-10-02 12:15:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 12:15:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-02 12:15:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-02 12:15:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-02 12:15:36,807 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-02 12:15:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:36,808 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-02 12:15:36,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-02 12:15:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:36,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:36,816 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-02 12:15:36,816 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:36,816 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-02 12:15:36,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:36,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:36,919 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-02 12:15:36,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:36,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:36,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:36,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:36,921 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-02 12:15:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:37,265 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-02 12:15:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:37,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:37,272 INFO L225 Difference]: With dead ends: 1257 [2018-10-02 12:15:37,272 INFO L226 Difference]: Without dead ends: 839 [2018-10-02 12:15:37,274 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 [2018-10-02 12:15:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-02 12:15:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-02 12:15:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-02 12:15:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-02 12:15:37,399 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-02 12:15:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:37,399 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-02 12:15:37,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-02 12:15:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:37,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:37,403 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-02 12:15:37,403 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:37,403 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-02 12:15:37,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:37,515 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-02 12:15:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:37,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:37,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:37,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:37,516 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-02 12:15:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:37,934 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-02 12:15:37,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:37,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:37,943 INFO L225 Difference]: With dead ends: 2505 [2018-10-02 12:15:37,943 INFO L226 Difference]: Without dead ends: 1671 [2018-10-02 12:15:37,946 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 [2018-10-02 12:15:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-02 12:15:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-02 12:15:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-02 12:15:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-02 12:15:38,173 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-02 12:15:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:38,173 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-02 12:15:38,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-02 12:15:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:38,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:38,177 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-02 12:15:38,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:38,177 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-02 12:15:38,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:38,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:38,452 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-02 12:15:38,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:15:38,453 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-02 12:15:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:38,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:15:39,554 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-02 12:15:39,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:15:39,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 12:15:39,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:15:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:15:39,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:39,588 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-02 12:15:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:45,301 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-02 12:15:45,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:15:45,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-02 12:15:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:45,317 INFO L225 Difference]: With dead ends: 4801 [2018-10-02 12:15:45,317 INFO L226 Difference]: Without dead ends: 3135 [2018-10-02 12:15:45,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.6s impTime [2018-10-02 12:15:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-02 12:15:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-02 12:15:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-02 12:15:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-02 12:15:45,707 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-02 12:15:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:45,707 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-02 12:15:45,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:15:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-02 12:15:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:45,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:45,712 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-02 12:15:45,714 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:45,714 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-02 12:15:45,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:45,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:45,873 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-02 12:15:45,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:45,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:45,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:45,874 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-02 12:15:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:46,481 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-02 12:15:46,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:46,491 INFO L225 Difference]: With dead ends: 4873 [2018-10-02 12:15:46,492 INFO L226 Difference]: Without dead ends: 2215 [2018-10-02 12:15:46,495 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 [2018-10-02 12:15:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-02 12:15:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-02 12:15:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-02 12:15:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-02 12:15:46,819 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-02 12:15:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:46,820 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-02 12:15:46,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-02 12:15:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:46,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:46,823 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-02 12:15:46,823 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:46,823 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-02 12:15:46,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:46,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:15:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:46,916 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-02 12:15:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:46,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:46,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:46,919 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-02 12:15:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:46,955 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-02 12:15:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:46,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:46,956 INFO L225 Difference]: With dead ends: 1799 [2018-10-02 12:15:46,956 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:15:46,961 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 [2018-10-02 12:15:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:15:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:15:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:15:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:15:46,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-02 12:15:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:46,962 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:15:46,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:15:46,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:15:46,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:15:47,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,134 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-02 12:15:47,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,408 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 12:15:47,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,558 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-02 12:15:47,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:47,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,053 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 12:15:48,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:48,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:49,390 WARN L178 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-02 12:15:50,603 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:50,716 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:50,850 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:51,494 WARN L178 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 12:15:51,955 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:52,094 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-02 12:15:52,416 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-02 12:15:52,540 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:52,699 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:52,890 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:53,087 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 12:15:53,273 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:53,275 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-02 12:15:53,275 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-02 12:15:53,275 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-02 12:15:53,275 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-02 12:15:53,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:53,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:53,276 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-02 12:15:53,276 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-02 12:15:53,276 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-02 12:15:53,276 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-02 12:15:53,276 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-02 12:15:53,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,277 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-02 12:15:53,278 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-02 12:15:53,278 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-02 12:15:53,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,302 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,303 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,305 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,315 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,315 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,316 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,317 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,318 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,319 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,323 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,323 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,325 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,325 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,327 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,328 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,336 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,336 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,337 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,338 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,341 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 02.10 12:15:53 BoogieIcfgContainer [2018-10-02 12:15:53,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:15:53,343 INFO L168 Benchmark]: Toolchain (without parser) took 20087.65 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 248.0 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -221.2 MB). Peak memory consumption was 701.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:53,344 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:15:53,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:15:53,345 INFO L168 Benchmark]: Boogie Preprocessor took 41.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:15:53,346 INFO L168 Benchmark]: RCFGBuilder took 764.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:53,348 INFO L168 Benchmark]: TraceAbstraction took 19209.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 248.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -274.0 MB). Peak memory consumption was 649.0 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:53,352 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 764.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19209.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 248.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -274.0 MB). Peak memory consumption was 649.0 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-02 12:15:53,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,365 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,365 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-02 12:15:53,366 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,366 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,367 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-02 12:15:53,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,370 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-02 12:15:53,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,373 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-02 12:15:53,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,375 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-02 12:15:53,377 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,379 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-02 12:15:53,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,381 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,381 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-02 12:15:53,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,383 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-02 12:15:53,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,386 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-02 12:15:53,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:53,388 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, 19.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s 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.3s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s 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-02_12-15-53-394.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-02_12-15-53-394.csv Received shutdown request...