java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:31:05,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:31:05,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:31:05,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:31:05,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:31:05,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:31:05,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:31:05,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:31:05,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:31:05,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:31:05,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:31:05,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:31:05,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:31:05,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:31:05,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:31:05,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:31:05,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:31:05,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:31:05,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:31:05,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:31:05,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:31:05,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:31:05,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:31:05,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:31:05,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:31:05,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:31:05,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:31:05,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:31:05,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:31:05,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:31:05,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:31:05,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:31:05,940 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:31:05,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:31:05,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:31:05,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:31:05,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:31:05,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:31:05,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:31:05,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:31:05,962 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:31:05,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:31:05,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:31:05,963 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:31:05,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:31:05,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:31:05,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:31:05,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:31:05,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:31:05,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:31:05,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:31:05,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:31:05,964 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:31:05,965 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:31:05,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:31:05,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:31:05,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:31:05,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:31:05,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:31:05,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:05,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:31:05,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:31:05,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:31:05,967 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:31:05,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:31:05,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:31:05,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:31:05,968 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:31:06,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:31:06,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:31:06,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:31:06,028 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:31:06,029 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:31:06,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 14:31:06,030 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 14:31:06,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:31:06,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:31:06,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:06,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:31:06,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:31:06,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:06,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:31:06,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:31:06,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:31:06,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... [2018-10-04 14:31:06,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:31:06,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:31:06,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:31:06,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:31:06,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:31:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:31:06,917 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:31:06,918 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:06 BoogieIcfgContainer [2018-10-04 14:31:06,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:31:06,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:31:06,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:31:06,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:31:06,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:06" (1/2) ... [2018-10-04 14:31:06,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1746af and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:31:06, skipping insertion in model container [2018-10-04 14:31:06,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:06" (2/2) ... [2018-10-04 14:31:06,926 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 14:31:06,936 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:31:06,944 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:31:06,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:31:06,992 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:31:06,992 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:31:06,992 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:31:06,993 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:31:06,993 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:31:06,993 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:31:06,993 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:31:06,993 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:31:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 14:31:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:07,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:07,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:07,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:07,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-04 14:31:07,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:07,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:07,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:07,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:07,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:07,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:07,336 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 14:31:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:07,398 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-04 14:31:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:07,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 14:31:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:07,414 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:31:07,414 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:31:07,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:31:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-04 14:31:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:31:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-04 14:31:07,456 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-04 14:31:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:07,457 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-04 14:31:07,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 14:31:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:07,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:07,458 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:07,458 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:07,459 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-04 14:31:07,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:07,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:07,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:07,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:07,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:07,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:07,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:07,600 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-04 14:31:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:07,658 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-04 14:31:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:07,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 14:31:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:07,660 INFO L225 Difference]: With dead ends: 91 [2018-10-04 14:31:07,660 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:31:07,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:31:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-04 14:31:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:31:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-04 14:31:07,680 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-04 14:31:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:07,680 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-04 14:31:07,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 14:31:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:07,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:07,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:07,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:07,682 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-04 14:31:07,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:07,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:07,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:07,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:07,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:07,848 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:07,849 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-04 14:31:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:07,918 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-04 14:31:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:07,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 14:31:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:07,922 INFO L225 Difference]: With dead ends: 175 [2018-10-04 14:31:07,923 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 14:31:07,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 14:31:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 14:31:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 14:31:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-04 14:31:07,973 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-04 14:31:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:07,973 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-04 14:31:07,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-04 14:31:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:07,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:07,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:07,976 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:07,976 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-04 14:31:07,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:07,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:07,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:08,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:08,068 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:08,068 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-04 14:31:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:08,170 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-04 14:31:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:08,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 14:31:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:08,177 INFO L225 Difference]: With dead ends: 343 [2018-10-04 14:31:08,177 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 14:31:08,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 14:31:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-04 14:31:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 14:31:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-04 14:31:08,246 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-04 14:31:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:08,249 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-04 14:31:08,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-04 14:31:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:08,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:08,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:08,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:08,251 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-04 14:31:08,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:08,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:08,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:08,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:08,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:08,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:08,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:08,390 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-04 14:31:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:08,516 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-04 14:31:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:08,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 14:31:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:08,520 INFO L225 Difference]: With dead ends: 569 [2018-10-04 14:31:08,520 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 14:31:08,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 14:31:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-04 14:31:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 14:31:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-04 14:31:08,601 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-04 14:31:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:08,602 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-04 14:31:08,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-04 14:31:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:31:08,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:08,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:08,604 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:08,604 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-04 14:31:08,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:31:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:31:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:31:08,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:08,823 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-04 14:31:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:09,076 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-04 14:31:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:31:09,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 14:31:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:09,082 INFO L225 Difference]: With dead ends: 610 [2018-10-04 14:31:09,082 INFO L226 Difference]: Without dead ends: 608 [2018-10-04 14:31:09,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:31:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-04 14:31:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-04 14:31:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-04 14:31:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-04 14:31:09,154 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-04 14:31:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:09,155 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-04 14:31:09,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:31:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-04 14:31:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:31:09,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:09,158 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] [2018-10-04 14:31:09,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:09,159 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:09,159 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-04 14:31:09,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:09,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:09,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:09,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:09,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:09,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:09,292 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-04 14:31:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:09,492 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-04 14:31:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:09,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 14:31:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:09,497 INFO L225 Difference]: With dead ends: 1113 [2018-10-04 14:31:09,497 INFO L226 Difference]: Without dead ends: 743 [2018-10-04 14:31:09,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-04 14:31:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-04 14:31:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 14:31:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-04 14:31:09,617 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-04 14:31:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:09,617 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-04 14:31:09,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-04 14:31:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:31:09,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:09,627 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:09,628 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:09,628 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-04 14:31:09,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:09,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:09,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:09,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:09,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:31:09,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:31:09,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:09,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:31:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:31:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:31:10,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 14:31:10,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:31:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:31:10,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:10,522 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-04 14:31:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:13,412 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-04 14:31:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:31:13,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-04 14:31:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:13,420 INFO L225 Difference]: With dead ends: 2109 [2018-10-04 14:31:13,420 INFO L226 Difference]: Without dead ends: 1371 [2018-10-04 14:31:13,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.5s impTime 13 [2018-10-04 14:31:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-04 14:31:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-04 14:31:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 14:31:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-04 14:31:13,721 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-04 14:31:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:13,721 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-04 14:31:13,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:31:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-04 14:31:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:31:13,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:13,725 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:31:13,725 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:13,725 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-04 14:31:13,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:13,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:13,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 14:31:13,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:13,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:13,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:13,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:13,870 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-04 14:31:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:14,215 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-04 14:31:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:14,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 14:31:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:14,222 INFO L225 Difference]: With dead ends: 2161 [2018-10-04 14:31:14,223 INFO L226 Difference]: Without dead ends: 975 [2018-10-04 14:31:14,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-04 14:31:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-04 14:31:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-04 14:31:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-04 14:31:14,400 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-04 14:31:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:14,400 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-04 14:31:14,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-04 14:31:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:31:14,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:14,402 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 14:31:14,402 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:14,403 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-04 14:31:14,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:14,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:31:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:31:14,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:14,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:14,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:14,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:14,489 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-04 14:31:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:14,506 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-04 14:31:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:14,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 14:31:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:14,507 INFO L225 Difference]: With dead ends: 799 [2018-10-04 14:31:14,507 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:31:14,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:31:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:31:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:31:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:31:14,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-04 14:31:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:14,509 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:31:14,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:31:14,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:31:14,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:31:14,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:14,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:15,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:17,271 WARN L178 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 14:31:17,465 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 14:31:17,753 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:18,403 WARN L178 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 14:31:18,520 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 14:31:18,759 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 14:31:18,973 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 14:31:19,721 WARN L178 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 14:31:19,867 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 14:31:20,200 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 14:31:20,434 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 14:31:20,577 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 14:31:20,710 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 14:31:20,715 INFO L421 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-10-04 14:31:20,715 INFO L421 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 14:31:20,715 INFO L421 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 14:31:20,715 INFO L421 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-10-04 14:31:20,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-04 14:31:20,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-04 14:31:20,716 INFO L421 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 14:31:20,716 INFO L421 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 14:31:20,716 INFO L421 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-04 14:31:20,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-04 14:31:20,716 INFO L421 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 14:31:20,717 INFO L421 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 14:31:20,717 INFO L421 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 14:31:20,717 INFO L421 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 14:31:20,717 INFO L421 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 14:31:20,718 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-04 14:31:20,718 INFO L421 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 14:31:20,718 INFO L421 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 14:31:20,718 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-04 14:31:20,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,764 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,764 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,769 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,769 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,776 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,776 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,783 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:31:20 BoogieIcfgContainer [2018-10-04 14:31:20,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:31:20,784 INFO L168 Benchmark]: Toolchain (without parser) took 14681.63 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -176.5 MB). Peak memory consumption was 618.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:20,785 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:20,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:20,786 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:20,787 INFO L168 Benchmark]: RCFGBuilder took 731.68 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:20,788 INFO L168 Benchmark]: TraceAbstraction took 13863.67 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -208.2 MB). Peak memory consumption was 587.0 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:20,792 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.65 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 35.98 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 731.68 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13863.67 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -208.2 MB). Peak memory consumption was 587.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-10-04 14:31:20,805 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,806 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,807 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,807 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-10-04 14:31:20,809 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,809 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,810 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,810 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-10-04 14:31:20,812 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,812 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,814 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,814 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-10-04 14:31:20,816 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,816 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,817 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,817 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-10-04 14:31:20,818 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,819 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,819 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,820 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-10-04 14:31:20,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,822 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,822 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-10-04 14:31:20,823 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,823 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-10-04 14:31:20,826 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,826 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 14:31:20,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred 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, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-31-20-834.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-31-20-834.csv Received shutdown request...