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.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:52:40,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:52:40,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:52:40,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:52:40,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:52:40,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:52:40,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:52:40,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:52:40,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:52:40,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:52:40,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:52:40,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:52:40,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:52:40,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:52:40,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:52:40,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:52:40,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:52:40,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:52:40,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:52:40,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:52:40,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:52:40,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:52:40,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:52:40,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:52:40,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:52:40,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:52:40,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:52:40,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:52:40,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:52:40,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:52:40,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:52:40,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:52:40,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:52:40,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:52:40,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:52:40,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:52:40,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:52:40,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:52:40,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:52:40,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:52:40,955 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:52:40,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:52:40,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:52:40,959 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:52:40,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:52:40,960 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:52:40,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:52:40,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:52:40,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:52:40,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:52:40,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:52:40,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:52:40,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:52:40,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:52:40,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:52:40,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:52:40,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:52:40,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:52:40,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:52:40,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:40,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:52:40,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:52:40,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:52:40,966 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:52:40,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:52:40,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:52:40,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:52:40,967 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:52:41,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:52:41,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:52:41,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:52:41,048 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:52:41,048 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:52:41,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 12:52:41,050 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl' [2018-10-04 12:52:41,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:52:41,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:52:41,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:41,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:52:41,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:52:41,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:41,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:52:41,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:52:41,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:52:41,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:52:41,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:52:41,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:52:41,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:52:41,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:52:41,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:52:41,922 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:52:41,923 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:41 BoogieIcfgContainer [2018-10-04 12:52:41,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:52:41,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:52:41,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:52:41,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:52:41,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/2) ... [2018-10-04 12:52:41,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695b2c5 and model type pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:41, skipping insertion in model container [2018-10-04 12:52:41,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:41" (2/2) ... [2018-10-04 12:52:41,936 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 12:52:41,947 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:52:41,959 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:52:42,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:52:42,020 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:52:42,020 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:52:42,020 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:52:42,020 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:52:42,020 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:52:42,020 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:52:42,021 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:52:42,023 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:52:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 12:52:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 12:52:42,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,335 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 12:52:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,393 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 12:52:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,414 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:52:42,414 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:52:42,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:52:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 12:52:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:52:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 12:52:42,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 12:52:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,460 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 12:52:42,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 12:52:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,462 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,462 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 12:52:42,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,601 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 12:52:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,634 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 12:52:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,640 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:52:42,641 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:52:42,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:52:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 12:52:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:52:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 12:52:42,673 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 12:52:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,677 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 12:52:42,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 12:52:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,679 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 12:52:42,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,778 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,778 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 12:52:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,848 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-04 12:52:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,852 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:52:42,853 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:52:42,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:52:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-04 12:52:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:52:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-04 12:52:42,879 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-04 12:52:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,880 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-04 12:52:42,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-04 12:52:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,885 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-04 12:52:42,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:43,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:43,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:43,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:43,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:43,036 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-04 12:52:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,123 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-04 12:52:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:43,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,127 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:52:43,127 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 12:52:43,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 12:52:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-04 12:52:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:52:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-04 12:52:43,161 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-04 12:52:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,161 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-04 12:52:43,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-04 12:52:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:43,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:43,163 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,163 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-04 12:52:43,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:43,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:43,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:52:43,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:52:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:52:43,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:43,293 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-04 12:52:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,496 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-04 12:52:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:52:43,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 12:52:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,505 INFO L225 Difference]: With dead ends: 293 [2018-10-04 12:52:43,505 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 12:52:43,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:52:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 12:52:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-04 12:52:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:52:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 12:52:43,568 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-04 12:52:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,569 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 12:52:43,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:52:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 12:52:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:52:43,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,571 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] [2018-10-04 12:52:43,571 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,571 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-04 12:52:43,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:43,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:43,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:43,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:43,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:43,666 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 12:52:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,770 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 12:52:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:43,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 12:52:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,775 INFO L225 Difference]: With dead ends: 525 [2018-10-04 12:52:43,775 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 12:52:43,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 12:52:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 12:52:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 12:52:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 12:52:43,864 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 12:52:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,865 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 12:52:43,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 12:52:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:52:43,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,870 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:43,870 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,870 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-04 12:52:43,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:44,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:52:44,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:52:44,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:44,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:52:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:52:44,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:52:44,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:52:44,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:52:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:52:44,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:44,859 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-10-04 12:52:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:47,460 INFO L93 Difference]: Finished difference Result 827 states and 1068 transitions. [2018-10-04 12:52:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:52:47,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-04 12:52:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:47,465 INFO L225 Difference]: With dead ends: 827 [2018-10-04 12:52:47,465 INFO L226 Difference]: Without dead ends: 481 [2018-10-04 12:52:47,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.8s impTime 16 [2018-10-04 12:52:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-10-04 12:52:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 307. [2018-10-04 12:52:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 12:52:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2018-10-04 12:52:47,539 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 28 [2018-10-04 12:52:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:47,540 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2018-10-04 12:52:47,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:52:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2018-10-04 12:52:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:52:47,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:47,546 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:47,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:47,546 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2104861015, now seen corresponding path program 2 times [2018-10-04 12:52:47,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:47,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:47,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:47,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:47,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-04 12:52:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:47,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:47,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:47,699 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand 3 states. [2018-10-04 12:52:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:47,742 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2018-10-04 12:52:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:47,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-04 12:52:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:47,744 INFO L225 Difference]: With dead ends: 357 [2018-10-04 12:52:47,744 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:52:47,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:52:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:52:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:52:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:52:47,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 12:52:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:47,746 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:52:47,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:52:47,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:52:47,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:52:47,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:47,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:48,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:48,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:49,267 WARN L178 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-04 12:52:51,383 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-04 12:52:51,512 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:52:51,688 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-04 12:52:51,856 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-04 12:52:52,451 WARN L178 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-04 12:52:52,796 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-04 12:52:53,086 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-10-04 12:52:53,294 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:52:53,467 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-04 12:52:53,471 INFO L421 ceAbstractionStarter]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-04 12:52:53,471 INFO L421 ceAbstractionStarter]: At program point L349(lines 344 350) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:52:53,471 INFO L421 ceAbstractionStarter]: At program point L271(lines 263 272) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-04 12:52:53,471 INFO L421 ceAbstractionStarter]: At program point L329(lines 329 335) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:52:53,472 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 371) no Hoare annotation was computed. [2018-10-04 12:52:53,472 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 371) no Hoare annotation was computed. [2018-10-04 12:52:53,472 INFO L421 ceAbstractionStarter]: At program point L276(lines 276 286) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-04 12:52:53,472 INFO L421 ceAbstractionStarter]: At program point L338(lines 334 345) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:52:53,472 INFO L421 ceAbstractionStarter]: At program point L231(lines 231 242) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:52:53,472 INFO L421 ceAbstractionStarter]: At program point L359(lines 359 366) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L293(lines 285 294) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-10-04 12:52:53,473 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 371) no Hoare annotation was computed. [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L368(lines 224 368) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L298(lines 298 309) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L315(lines 308 316) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L249(lines 241 250) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-04 12:52:53,473 INFO L421 ceAbstractionStarter]: At program point L365(lines 365 369) the Hoare annotation is: false [2018-10-04 12:52:53,474 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 370) no Hoare annotation was computed. [2018-10-04 12:52:53,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,518 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,518 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,521 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,522 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,522 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,522 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,526 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,526 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,527 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,539 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:52:53 BoogieIcfgContainer [2018-10-04 12:52:53,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:52:53,540 INFO L168 Benchmark]: Toolchain (without parser) took 12391.21 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 15.7 MB). Peak memory consumption was 489.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:53,542 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:53,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:53,549 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:53,550 INFO L168 Benchmark]: RCFGBuilder took 688.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:53,553 INFO L168 Benchmark]: TraceAbstraction took 11611.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -26.6 MB). Peak memory consumption was 447.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:53,559 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 688.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11611.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -26.6 MB). Peak memory consumption was 447.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: 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: 263]: Loop Invariant [2018-10-04 12:52:53,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 285]: Loop Invariant [2018-10-04 12:52:53,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,573 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 254]: Loop Invariant [2018-10-04 12:52:53,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 276]: Loop Invariant [2018-10-04 12:52:53,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 298]: Loop Invariant [2018-10-04 12:52:53,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,584 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,584 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode4 && ~send3 <= 127) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 241]: Loop Invariant [2018-10-04 12:52:53,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,587 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:53,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 11.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 5.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 179 SDslu, 174 SDs, 0 SdLazy, 208 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 72 NumberOfFragments, 1161 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5056 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 439 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 8 QuantifiedInterpolants, 21881 SizeOfPredicates, 1 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 101/117 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.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-52-53-594.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-52-53-594.csv Received shutdown request...