java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:42:17,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:42:17,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:42:17,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:42:17,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:42:17,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:42:17,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:42:17,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:42:17,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:42:17,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:42:17,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:42:17,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:42:17,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:42:17,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:42:17,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:42:17,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:42:17,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:42:17,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:42:17,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:42:17,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:42:17,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:42:17,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:42:17,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:42:17,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:42:17,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:42:17,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:42:17,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:42:17,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:42:17,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:42:17,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:42:17,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:42:17,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:42:17,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:42:17,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:42:17,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:42:17,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:42:17,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:42:17,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:42:17,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:42:17,864 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:42:17,865 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:42:17,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:42:17,865 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:42:17,866 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:42:17,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:42:17,866 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:42:17,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:42:17,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:42:17,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:42:17,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:42:17,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:42:17,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:42:17,867 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:42:17,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:42:17,868 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:42:17,868 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:42:17,868 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:42:17,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:42:17,869 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:42:17,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:42:17,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:42:17,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:42:17,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:42:17,870 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:42:17,870 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:42:17,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:42:17,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:42:17,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:42:17,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:42:17,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:42:17,952 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:42:17,952 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:42:17,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-09-30 23:42:17,953 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl' [2018-09-30 23:42:18,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:42:18,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:42:18,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:42:18,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:42:18,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:42:18,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:42:18,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:42:18,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:42:18,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:42:18,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... [2018-09-30 23:42:18,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:42:18,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:42:18,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:42:18,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:42:18,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:42:18,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:42:18,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:42:18,882 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:42:18,882 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:42:18 BoogieIcfgContainer [2018-09-30 23:42:18,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:42:18,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:42:18,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:42:18,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:42:18,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:42:18" (1/2) ... [2018-09-30 23:42:18,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de953b5 and model type pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:42:18, skipping insertion in model container [2018-09-30 23:42:18,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:42:18" (2/2) ... [2018-09-30 23:42:18,891 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-09-30 23:42:18,901 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:42:18,909 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:42:18,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:42:18,961 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:42:18,961 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:42:18,961 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:42:18,961 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:42:18,962 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:42:18,962 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:42:18,962 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:42:18,962 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:42:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-30 23:42:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:18,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:18,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:42:18,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:18,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-09-30 23:42:18,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:18,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:19,359 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:19,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:19,384 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-09-30 23:42:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:19,464 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-09-30 23:42:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:19,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:19,478 INFO L225 Difference]: With dead ends: 60 [2018-09-30 23:42:19,478 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 23:42:19,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 23:42:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-09-30 23:42:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 23:42:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-09-30 23:42:19,535 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-09-30 23:42:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:19,535 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-09-30 23:42:19,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-09-30 23:42:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:19,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:19,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:42:19,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:19,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-09-30 23:42:19,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:19,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:19,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:19,726 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:19,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:19,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:19,729 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-09-30 23:42:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:19,786 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-09-30 23:42:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:19,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:19,789 INFO L225 Difference]: With dead ends: 109 [2018-09-30 23:42:19,789 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 23:42:19,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 23:42:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-09-30 23:42:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 23:42:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-09-30 23:42:19,810 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-09-30 23:42:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:19,810 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-09-30 23:42:19,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-09-30 23:42:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:19,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:19,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:42:19,812 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:19,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-09-30 23:42:19,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:19,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:19,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:19,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:19,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:19,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:19,928 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-09-30 23:42:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:19,999 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-09-30 23:42:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:20,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:20,008 INFO L225 Difference]: With dead ends: 211 [2018-09-30 23:42:20,008 INFO L226 Difference]: Without dead ends: 141 [2018-09-30 23:42:20,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-30 23:42:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-09-30 23:42:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-30 23:42:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-09-30 23:42:20,071 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-09-30 23:42:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:20,071 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-09-30 23:42:20,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-09-30 23:42:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:20,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:20,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:42:20,073 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:20,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:20,074 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-09-30 23:42:20,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:20,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:20,228 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:20,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:20,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:20,229 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-09-30 23:42:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:20,382 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-09-30 23:42:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:20,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 23:42:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:20,386 INFO L225 Difference]: With dead ends: 349 [2018-09-30 23:42:20,386 INFO L226 Difference]: Without dead ends: 211 [2018-09-30 23:42:20,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-30 23:42:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-09-30 23:42:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-30 23:42:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-09-30 23:42:20,425 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-09-30 23:42:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:20,428 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-09-30 23:42:20,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-09-30 23:42:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:42:20,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:20,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:42:20,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:20,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-09-30 23:42:20,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:20,634 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:20,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:42:20,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:42:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:42:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:42:20,636 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-09-30 23:42:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:20,876 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-09-30 23:42:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:42:20,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-09-30 23:42:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:20,883 INFO L225 Difference]: With dead ends: 377 [2018-09-30 23:42:20,883 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 23:42:20,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:42:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 23:42:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-09-30 23:42:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 23:42:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-09-30 23:42:20,947 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-09-30 23:42:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:20,947 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-09-30 23:42:20,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:42:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-09-30 23:42:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:20,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:20,950 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, 1, 1] [2018-09-30 23:42:20,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:20,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-09-30 23:42:20,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:20,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:20,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:20,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:21,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:21,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:21,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:21,126 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-09-30 23:42:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:21,253 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-09-30 23:42:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:21,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:21,257 INFO L225 Difference]: With dead ends: 669 [2018-09-30 23:42:21,257 INFO L226 Difference]: Without dead ends: 447 [2018-09-30 23:42:21,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-30 23:42:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-09-30 23:42:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 23:42:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-09-30 23:42:21,335 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-09-30 23:42:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:21,336 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-09-30 23:42:21,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-09-30 23:42:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:21,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:21,339 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, 1, 1] [2018-09-30 23:42:21,339 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-09-30 23:42:21,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:21,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:21,527 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:21,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:21,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:21,529 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-09-30 23:42:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:21,715 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-09-30 23:42:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:21,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:21,721 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 23:42:21,721 INFO L226 Difference]: Without dead ends: 887 [2018-09-30 23:42:21,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-09-30 23:42:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-09-30 23:42:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-09-30 23:42:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-09-30 23:42:21,855 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-09-30 23:42:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:21,855 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-09-30 23:42:21,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-09-30 23:42:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:21,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:21,867 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, 1, 1] [2018-09-30 23:42:21,867 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:21,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-09-30 23:42:21,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:21,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:22,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:22,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:42:22,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:22,028 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-09-30 23:42:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:22,361 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-09-30 23:42:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:22,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 23:42:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:22,370 INFO L225 Difference]: With dead ends: 2649 [2018-09-30 23:42:22,371 INFO L226 Difference]: Without dead ends: 1767 [2018-09-30 23:42:22,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-09-30 23:42:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-09-30 23:42:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-09-30 23:42:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-09-30 23:42:22,616 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-09-30 23:42:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:22,616 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-09-30 23:42:22,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-09-30 23:42:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 23:42:22,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:22,619 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, 1, 1] [2018-09-30 23:42:22,620 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:22,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-09-30 23:42:22,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:22,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:22,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:22,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:22,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:42:22,917 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:42:22,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:23,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:42:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:42:23,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:42:23,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 23:42:23,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:42:23,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:42:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:42:23,304 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-09-30 23:42:23,537 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 23:42:24,073 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:42:26,190 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 23:42:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:27,634 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-09-30 23:42:27,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:42:27,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-09-30 23:42:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:27,642 INFO L225 Difference]: With dead ends: 4087 [2018-09-30 23:42:27,643 INFO L226 Difference]: Without dead ends: 1617 [2018-09-30 23:42:27,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:42:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-09-30 23:42:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-09-30 23:42:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-09-30 23:42:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-09-30 23:42:27,873 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-09-30 23:42:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:27,873 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-09-30 23:42:27,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:42:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-09-30 23:42:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 23:42:27,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:27,876 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, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 23:42:27,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:27,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:27,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-09-30 23:42:27,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:27,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:42:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-30 23:42:27,957 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:42:27,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:42:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:42:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:42:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:27,959 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-09-30 23:42:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:27,994 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-09-30 23:42:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:42:27,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-09-30 23:42:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:27,994 INFO L225 Difference]: With dead ends: 1464 [2018-09-30 23:42:27,995 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:42:27,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:42:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:42:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:42:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:42:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:42:27,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-09-30 23:42:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:27,998 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:42:27,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:42:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:42:27,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:42:28,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:42:28,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:28,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:42:29,560 WARN L178 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-30 23:42:29,764 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-30 23:42:30,520 WARN L178 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:42:30,769 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 23:42:30,978 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-30 23:42:31,336 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-09-30 23:42:31,711 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:42:31,961 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 23:42:32,283 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-09-30 23:42:32,387 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-09-30 23:42:32,581 INFO L422 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-30 23:42:32,581 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,581 INFO L422 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-30 23:42:32,582 INFO L422 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-09-30 23:42:32,582 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-30 23:42:32,582 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:32,582 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:32,582 INFO L422 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-30 23:42:32,582 INFO L422 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-09-30 23:42:32,582 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-09-30 23:42:32,583 INFO L422 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-09-30 23:42:32,583 INFO L422 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,583 INFO L422 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-09-30 23:42:32,583 INFO L422 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-09-30 23:42:32,584 INFO L422 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-09-30 23:42:32,584 INFO L422 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,584 INFO L422 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-30 23:42:32,584 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-30 23:42:32,584 INFO L422 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-30 23:42:32,584 INFO L422 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,585 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,585 INFO L422 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-30 23:42:32,593 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,603 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,603 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,604 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,613 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,614 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,618 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,619 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,622 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,622 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,623 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,623 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,625 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,625 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,626 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,629 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,629 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,631 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,631 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,636 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,636 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,638 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,642 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:42:32 BoogieIcfgContainer [2018-09-30 23:42:32,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:42:32,644 INFO L168 Benchmark]: Toolchain (without parser) took 14583.98 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.9 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -34.2 MB). Peak memory consumption was 604.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:42:32,645 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:42:32,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:42:32,646 INFO L168 Benchmark]: Boogie Preprocessor took 54.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:42:32,646 INFO L168 Benchmark]: RCFGBuilder took 705.72 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.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-30 23:42:32,647 INFO L168 Benchmark]: TraceAbstraction took 13758.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -87.1 MB). Peak memory consumption was 551.9 MB. Max. memory is 7.1 GB. [2018-09-30 23:42:32,651 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.57 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 54.59 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 705.72 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.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13758.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -87.1 MB). Peak memory consumption was 551.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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 480]: Loop Invariant [2018-09-30 23:42:32,662 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,662 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant [2018-09-30 23:42:32,665 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,665 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,666 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,666 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant [2018-09-30 23:42:32,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,669 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,670 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 396]: Loop Invariant [2018-09-30 23:42:32,671 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,671 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,676 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,676 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant [2018-09-30 23:42:32,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant [2018-09-30 23:42:32,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant [2018-09-30 23:42:32,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,690 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,690 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 383]: Loop Invariant [2018-09-30 23:42:32,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant [2018-09-30 23:42:32,696 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,696 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-30 23:42:32,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1408 HoareAnnotationTreeSize, 18 FomulaSimplifications, 41599 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 334 ConstructedInterpolants, 12 QuantifiedInterpolants, 42481 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 167/187 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.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-42-32-712.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-42-32-712.csv Received shutdown request...