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/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:38:49,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:38:49,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:38:49,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:38:49,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:38:49,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:38:49,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:38:49,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:38:49,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:38:49,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:38:49,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:38:49,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:38:49,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:38:49,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:38:49,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:38:49,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:38:49,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:38:49,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:38:49,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:38:49,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:38:49,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:38:49,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:38:49,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:38:49,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:38:49,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:38:49,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:38:49,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:38:49,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:38:49,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:38:49,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:38:49,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:38:49,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:38:49,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:38:49,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:38:49,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:38:49,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:38:49,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:38:49,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:38:49,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:38:49,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:38:49,297 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:38:49,298 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:38:49,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:38:49,298 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:38:49,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:38:49,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:38:49,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:38:49,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:38:49,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:38:49,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:38:49,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:38:49,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:38:49,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:38:49,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:38:49,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:38:49,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:38:49,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:38:49,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:38:49,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:38:49,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:38:49,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:38:49,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:38:49,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:38:49,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:38:49,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:38:49,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:38:49,303 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:38:49,303 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:38:49,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:38:49,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:38:49,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:38:49,371 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:38:49,372 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:38:49,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-01 00:38:49,373 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-10-01 00:38:49,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:38:49,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:38:49,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:49,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:38:49,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:38:49,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:49,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:38:49,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:38:49,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:38:49,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... [2018-10-01 00:38:49,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:38:49,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:38:49,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:38:49,524 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:38:49,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:38:49,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:38:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:38:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:38:50,116 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:38:50,116 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:50 BoogieIcfgContainer [2018-10-01 00:38:50,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:38:50,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:38:50,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:38:50,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:38:50,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:49" (1/2) ... [2018-10-01 00:38:50,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5718456b and model type pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:38:50, skipping insertion in model container [2018-10-01 00:38:50,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:50" (2/2) ... [2018-10-01 00:38:50,125 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-01 00:38:50,134 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:38:50,144 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:38:50,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:38:50,195 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:38:50,195 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:38:50,196 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:38:50,196 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:38:50,196 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:38:50,196 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:38:50,196 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:38:50,197 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:38:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-01 00:38:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:38:50,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:50,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:50,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:50,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-01 00:38:50,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:50,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:50,491 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:50,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:50,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:50,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:50,517 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-01 00:38:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:50,616 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-01 00:38:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:50,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-01 00:38:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:50,630 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:38:50,630 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:38:50,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:38:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:38:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:38:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-01 00:38:50,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-10-01 00:38:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:50,679 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-01 00:38:50,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-01 00:38:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:38:50,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:50,680 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:50,680 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:50,680 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2078913255, now seen corresponding path program 1 times [2018-10-01 00:38:50,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:50,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:50,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:50,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:50,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:50,804 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-10-01 00:38:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:50,901 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-10-01 00:38:50,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:50,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-01 00:38:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:50,904 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:38:50,904 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:38:50,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:38:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-01 00:38:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:38:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-10-01 00:38:50,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2018-10-01 00:38:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:50,914 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-10-01 00:38:50,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-10-01 00:38:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:38:50,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:50,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:50,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:50,916 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2136171557, now seen corresponding path program 1 times [2018-10-01 00:38:50,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:50,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:50,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:51,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:51,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:38:51,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:38:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:38:51,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:51,071 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 4 states. [2018-10-01 00:38:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:51,331 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-10-01 00:38:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:38:51,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-01 00:38:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:51,334 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:38:51,334 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:38:51,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:38:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2018-10-01 00:38:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:38:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-10-01 00:38:51,351 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 14 [2018-10-01 00:38:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:51,351 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-10-01 00:38:51,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:38:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-10-01 00:38:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:38:51,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:51,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:51,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:51,360 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2136111975, now seen corresponding path program 1 times [2018-10-01 00:38:51,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:51,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:51,482 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:51,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:38:51,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:38:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:38:51,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:51,483 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 4 states. [2018-10-01 00:38:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:51,711 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-10-01 00:38:51,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:38:51,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-01 00:38:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:51,715 INFO L225 Difference]: With dead ends: 84 [2018-10-01 00:38:51,715 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 00:38:51,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 00:38:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-10-01 00:38:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:38:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-10-01 00:38:51,728 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 14 [2018-10-01 00:38:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:51,728 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-10-01 00:38:51,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:38:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-10-01 00:38:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:38:51,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:51,730 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:51,730 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:51,730 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1820688235, now seen corresponding path program 1 times [2018-10-01 00:38:51,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:51,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:51,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:51,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:51,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:51,841 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-10-01 00:38:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:51,869 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-10-01 00:38:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:51,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-01 00:38:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:51,871 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:38:51,871 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:38:51,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:38:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:38:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:38:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-10-01 00:38:51,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2018-10-01 00:38:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:51,883 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-10-01 00:38:51,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-10-01 00:38:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:38:51,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:51,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:51,885 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:51,885 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1912016391, now seen corresponding path program 1 times [2018-10-01 00:38:51,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:51,968 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:51,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:38:51,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:51,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:51,969 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 3 states. [2018-10-01 00:38:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:52,109 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2018-10-01 00:38:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:52,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-01 00:38:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:52,113 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:38:52,113 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:38:52,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:38:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-01 00:38:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:38:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-10-01 00:38:52,132 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 26 [2018-10-01 00:38:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:52,132 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-10-01 00:38:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-10-01 00:38:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:38:52,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:52,134 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] [2018-10-01 00:38:52,134 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:52,135 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1573604279, now seen corresponding path program 1 times [2018-10-01 00:38:52,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:52,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:52,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:52,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:52,342 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) [2018-10-01 00:38:52,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:52,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:38:52,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:52,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-01 00:38:52,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:38:52,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:38:52,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:52,823 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 7 states. [2018-10-01 00:38:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:54,460 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-10-01 00:38:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:38:54,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-01 00:38:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:54,465 INFO L225 Difference]: With dead ends: 257 [2018-10-01 00:38:54,468 INFO L226 Difference]: Without dead ends: 153 [2018-10-01 00:38:54,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:38:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-01 00:38:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-10-01 00:38:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-01 00:38:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2018-10-01 00:38:54,516 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 26 [2018-10-01 00:38:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:54,517 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2018-10-01 00:38:54,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:38:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2018-10-01 00:38:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:38:54,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:54,519 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:54,520 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:54,520 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash -53844841, now seen corresponding path program 2 times [2018-10-01 00:38:54,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:54,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:54,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-01 00:38:54,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:54,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:54,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:54,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:54,642 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand 3 states. [2018-10-01 00:38:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:54,650 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2018-10-01 00:38:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:54,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-01 00:38:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:54,651 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:38:54,651 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:38:54,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:38:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:38:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:38:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:38:54,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-01 00:38:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:54,653 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:38:54,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:38:54,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:38:54,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:38:55,721 WARN L178 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-10-01 00:38:55,852 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-10-01 00:38:56,366 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-10-01 00:38:56,735 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-10-01 00:38:56,862 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-10-01 00:38:56,964 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 316) no Hoare annotation was computed. [2018-10-01 00:38:56,964 INFO L422 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) .cse0 (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-10-01 00:38:56,964 INFO L422 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:38:56,965 INFO L422 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse0 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p2_new))) (or (and .cse0 .cse1 (<= 1 ~mode3)) (and .cse0 (<= ~r1 1) .cse1 .cse2) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2))) [2018-10-01 00:38:56,965 INFO L422 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-01 00:38:56,965 INFO L422 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-01 00:38:56,965 INFO L422 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (<= 1 ULTIMATE.start_main_~c1~82) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:38:56,965 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 316) no Hoare annotation was computed. [2018-10-01 00:38:56,966 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 316) no Hoare annotation was computed. [2018-10-01 00:38:56,966 INFO L422 ceAbstractionStarter]: At program point L313(lines 192 313) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)) (and (not (= (+ ~p2_old 1) 0)) .cse0 (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-01 00:38:56,966 INFO L422 ceAbstractionStarter]: At program point L214(lines 205 215) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) .cse0 (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-10-01 00:38:56,966 INFO L422 ceAbstractionStarter]: At program point L243(lines 243 252) the Hoare annotation is: (let ((.cse0 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p2_new))) (or (and .cse0 .cse1 (<= 1 ~mode3)) (and .cse0 (<= ~r1 1) .cse1 .cse2) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2))) [2018-10-01 00:38:56,966 INFO L422 ceAbstractionStarter]: At program point L307(lines 307 314) the Hoare annotation is: false [2018-10-01 00:38:56,967 INFO L422 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (and (<= ~r1 1) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:38:56,967 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 315) no Hoare annotation was computed. [2018-10-01 00:38:56,967 INFO L422 ceAbstractionStarter]: At program point L198(lines 198 206) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)) (and (not (= (+ ~p2_old 1) 0)) .cse0 (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-01 00:38:56,967 INFO L422 ceAbstractionStarter]: At program point L258(lines 251 259) the Hoare annotation is: (and (<= ~r1 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 0 ~p2_new)) [2018-10-01 00:38:56,985 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:38:56 BoogieIcfgContainer [2018-10-01 00:38:56,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:38:56,986 INFO L168 Benchmark]: Toolchain (without parser) took 7540.91 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 364.8 MB). Peak memory consumption was 364.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:56,988 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:56,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:56,989 INFO L168 Benchmark]: Boogie Preprocessor took 29.99 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:56,990 INFO L168 Benchmark]: RCFGBuilder took 593.31 ms. Allocated memory is still 1.6 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-01 00:38:56,991 INFO L168 Benchmark]: TraceAbstraction took 6867.47 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 333.1 MB). Peak memory consumption was 333.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:56,997 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.99 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 593.31 ms. Allocated memory is still 1.6 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 6867.47 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 333.1 MB). Peak memory consumption was 333.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 315]: 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: 192]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) || (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) && 1 <= assert_~arg) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) && 1 <= assert_~arg) || (((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) || (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) && 1 <= assert_~arg) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) || (((!(~p2_old + 1 == 0) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_#in~arg - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((1 <= check_~tmp~75 && 1 <= main_~c1~82) && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) && 1 <= assert_~arg) || (((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((~r1 <= 1 && 1 <= ~mode3) && 0 == ~nomsg + 1) && 0 <= ~p2_new - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 0 == ~nomsg + 1) && 1 <= ~mode3) || (((!(~p2_old + 1 == 0) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((~r1 <= 1 && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((1 <= check_~tmp~75 && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 191 SDslu, 207 SDs, 0 SdLazy, 118 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=7, 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 65 NumberOfFragments, 352 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1745 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 867 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 15301 SizeOfPredicates, 1 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 64/72 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.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-38-57-014.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-38-57-014.csv Received shutdown request...