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.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:04,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:04,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:04,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:04,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:04,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:04,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:04,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:04,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:04,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:04,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:04,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:04,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:04,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:04,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:04,873 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:04,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:04,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:04,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:04,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:04,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:04,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:04,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:04,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:04,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:04,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:04,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:04,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:04,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:04,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:04,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:04,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:04,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:04,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:04,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:04,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:04,912 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-01 00:55:04,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:04,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:04,937 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:04,940 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:04,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:04,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:04,941 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:04,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:04,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:04,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:04,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:04,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:04,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:04,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:04,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:04,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:04,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:04,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:04,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:04,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:04,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:04,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:04,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:04,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:04,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:04,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:04,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:04,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:04,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:04,948 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:04,948 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:05,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:05,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:05,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:05,039 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:05,040 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:05,041 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.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:55:05,041 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-01 00:55:05,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:05,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:05,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:05,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:05,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:05,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:05,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:05,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:05,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:05,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:05,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:05,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:05,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:05,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (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-01 00:55:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:05,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:06,022 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:06,022 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:06 BoogieIcfgContainer [2018-10-01 00:55:06,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:06,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:06,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:06,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:06,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/2) ... [2018-10-01 00:55:06,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40493a4c and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:06, skipping insertion in model container [2018-10-01 00:55:06,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:06" (2/2) ... [2018-10-01 00:55:06,031 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:55:06,041 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:06,049 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:06,101 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:06,102 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:06,102 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:06,102 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:06,103 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:06,103 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:06,103 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:06,103 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:06,103 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-01 00:55:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:06,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:06,133 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-01 00:55:06,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:06,141 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-01 00:55:06,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:06,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:06,425 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-01 00:55:06,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:06,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:06,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:06,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:06,446 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-01 00:55:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:06,567 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-01 00:55:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:06,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:06,582 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:55:06,582 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:55:06,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:55:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-01 00:55:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:55:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-01 00:55:06,631 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-01 00:55:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:06,632 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-01 00:55:06,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-01 00:55:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:06,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:06,633 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-01 00:55:06,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:06,633 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-01 00:55:06,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:06,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:06,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:06,825 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-01 00:55:06,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:06,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:06,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:06,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:06,831 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-01 00:55:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:06,912 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-01 00:55:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:06,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:06,915 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:55:06,915 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:55:06,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:55:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-01 00:55:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:55:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-01 00:55:06,941 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-01 00:55:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:06,942 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-01 00:55:06,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-01 00:55:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:06,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:06,943 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-01 00:55:06,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:06,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-01 00:55:06,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:07,153 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:07,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:07,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,155 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-01 00:55:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:07,424 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-01 00:55:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:07,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-01 00:55:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:07,434 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:55:07,434 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:55:07,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:55:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:55:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-01 00:55:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:55:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-01 00:55:07,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-01 00:55:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:07,471 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-01 00:55:07,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-01 00:55:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:07,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:07,472 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-01 00:55:07,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:07,473 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-01 00:55:07,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,587 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-01 00:55:07,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:07,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:07,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,589 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-01 00:55:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:07,716 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-01 00:55:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:07,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:07,721 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:55:07,721 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:55:07,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:55:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-01 00:55:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:55:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-01 00:55:07,754 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-01 00:55:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:07,757 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-01 00:55:07,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-01 00:55:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:07,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:07,759 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-01 00:55:07,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:07,759 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-01 00:55:07,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,857 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-01 00:55:07,857 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:07,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:07,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,858 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-01 00:55:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:08,032 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-01 00:55:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:08,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:08,035 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:55:08,035 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:55:08,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:55:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-01 00:55:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:55:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-01 00:55:08,079 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-01 00:55:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:08,080 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-01 00:55:08,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-01 00:55:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:08,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:08,082 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-01 00:55:08,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:08,083 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-01 00:55:08,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:08,209 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-01 00:55:08,209 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:08,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:08,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:08,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:08,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:08,211 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-01 00:55:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:08,466 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-01 00:55:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:08,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:08,470 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:55:08,470 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:55:08,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:55:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-01 00:55:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:55:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-01 00:55:08,556 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-01 00:55:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:08,557 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-01 00:55:08,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-01 00:55:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:08,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:08,562 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-01 00:55:08,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:08,564 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-01 00:55:08,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:08,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:08,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:08,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:08,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:08,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:08,736 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-01 00:55:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:09,123 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-01 00:55:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:09,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:09,129 INFO L225 Difference]: With dead ends: 1257 [2018-10-01 00:55:09,129 INFO L226 Difference]: Without dead ends: 839 [2018-10-01 00:55:09,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-01 00:55:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-01 00:55:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-01 00:55:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-01 00:55:09,262 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-01 00:55:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:09,263 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-01 00:55:09,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-01 00:55:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:09,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:09,271 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-01 00:55:09,272 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:09,272 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-01 00:55:09,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:09,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:09,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:09,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:09,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:09,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:09,406 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-01 00:55:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:09,921 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-01 00:55:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:09,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:09,933 INFO L225 Difference]: With dead ends: 2505 [2018-10-01 00:55:09,933 INFO L226 Difference]: Without dead ends: 1671 [2018-10-01 00:55:09,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-01 00:55:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-01 00:55:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-01 00:55:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-01 00:55:10,204 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-01 00:55:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:10,205 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-01 00:55:10,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-01 00:55:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:10,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:10,208 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-01 00:55:10,209 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:10,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-01 00:55:10,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:10,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:10,574 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-01 00:55:10,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:10,574 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-01 00:55:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:10,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:11,458 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-01 00:55:11,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:11,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-01 00:55:11,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:55:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:55:11,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:11,492 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-01 00:55:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:16,407 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-01 00:55:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:55:16,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-01 00:55:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:16,423 INFO L225 Difference]: With dead ends: 4801 [2018-10-01 00:55:16,423 INFO L226 Difference]: Without dead ends: 3135 [2018-10-01 00:55:16,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:55:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-01 00:55:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-01 00:55:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-01 00:55:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-01 00:55:16,814 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-01 00:55:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:16,814 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-01 00:55:16,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:55:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-01 00:55:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:16,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:16,823 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-01 00:55:16,825 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:16,825 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-01 00:55:16,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:16,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:16,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:17,005 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-01 00:55:17,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:17,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:17,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:17,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:17,007 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-01 00:55:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:17,488 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-01 00:55:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:17,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:17,498 INFO L225 Difference]: With dead ends: 4873 [2018-10-01 00:55:17,498 INFO L226 Difference]: Without dead ends: 2215 [2018-10-01 00:55:17,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-01 00:55:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-01 00:55:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-01 00:55:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-01 00:55:17,795 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-01 00:55:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:17,795 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-01 00:55:17,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-01 00:55:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:17,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:17,799 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-01 00:55:17,799 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:17,799 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-01 00:55:17,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:17,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:17,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:55:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:17,904 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-01 00:55:17,904 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:17,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:17,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:17,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:17,907 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-01 00:55:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:17,945 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-01 00:55:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:17,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:17,946 INFO L225 Difference]: With dead ends: 1799 [2018-10-01 00:55:17,946 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:55:17,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:55:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:55:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:55:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:55:17,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-01 00:55:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:17,950 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:55:17,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:55:17,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:55:17,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:55:18,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,112 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-01 00:55:18,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,381 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-01 00:55:18,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,953 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-01 00:55:18,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:18,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:19,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,017 WARN L178 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-01 00:55:20,149 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:20,287 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:20,960 WARN L178 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:21,123 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-01 00:55:21,315 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:21,630 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:21,762 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:21,992 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-01 00:55:22,110 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:22,312 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-01 00:55:22,494 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:22,497 INFO L422 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-01 00:55:22,497 INFO L422 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-01 00:55:22,497 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-01 00:55:22,498 INFO L422 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-01 00:55:22,498 INFO L422 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-01 00:55:22,498 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:22,498 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:22,498 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-01 00:55:22,499 INFO L422 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-01 00:55:22,499 INFO L422 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-01 00:55:22,499 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:55:22,499 INFO L422 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-01 00:55:22,499 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:22,500 INFO L422 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-01 00:55:22,500 INFO L422 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-01 00:55:22,500 INFO L422 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-01 00:55:22,500 INFO L422 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-01 00:55:22,500 INFO L422 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-01 00:55:22,501 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:55:22,501 INFO L422 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-01 00:55:22,501 INFO L422 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-01 00:55:22,514 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,516 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,518 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,518 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,520 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,521 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,522 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,523 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,528 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,528 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,530 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,530 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,532 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,533 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,544 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,545 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,546 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,546 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,549 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,549 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,551 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,551 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,553 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,554 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,555 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,556 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,557 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,558 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,559 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,559 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,562 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:22 BoogieIcfgContainer [2018-10-01 00:55:22,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:22,563 INFO L168 Benchmark]: Toolchain (without parser) took 17403.77 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 284.2 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -271.5 MB). Peak memory consumption was 719.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:22,564 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-01 00:55:22,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.85 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-01 00:55:22,566 INFO L168 Benchmark]: Boogie Preprocessor took 62.90 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-01 00:55:22,566 INFO L168 Benchmark]: RCFGBuilder took 740.05 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-01 00:55:22,567 INFO L168 Benchmark]: TraceAbstraction took 16538.21 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 284.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -324.3 MB). Peak memory consumption was 666.9 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:22,572 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.85 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 62.90 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 740.05 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 16538.21 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 284.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -324.3 MB). Peak memory consumption was 666.9 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-01 00:55:22,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,586 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,586 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-01 00:55:22,587 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,587 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-01 00:55:22,593 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,593 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-10-01 00:55:22,595 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,595 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,598 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,598 WARN L389 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-01 00:55:22,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-01 00:55:22,604 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,604 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-01 00:55:22,609 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,609 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-01 00:55:22,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-01 00:55:22,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,617 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,617 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,618 WARN L389 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-01 00:55:22,618 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,619 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,619 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:22,619 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s 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.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.3s 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.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-22-625.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-22-625.csv Received shutdown request...