java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/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-9f4048f [2018-10-04 12:18:53,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:18:53,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:18:53,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:18:53,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:18:53,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:18:53,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:18:53,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:18:53,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:18:53,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:18:53,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:18:53,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:18:53,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:18:53,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:18:53,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:18:53,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:18:53,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:18:53,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:18:53,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:18:53,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:18:53,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:18:53,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:18:53,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:18:53,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:18:53,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:18:53,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:18:53,444 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:18:53,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:18:53,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:18:53,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:18:53,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:18:53,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:18:53,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:18:53,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:18:53,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:18:53,455 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:18:53,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:18:53,484 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:18:53,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:18:53,485 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:18:53,485 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:18:53,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:18:53,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:18:53,489 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:18:53,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:18:53,489 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:18:53,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:18:53,490 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:18:53,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:18:53,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:18:53,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:18:53,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:18:53,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:18:53,492 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:18:53,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:18:53,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:18:53,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:18:53,493 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:18:53,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:18:53,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:18:53,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:18:53,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:18:53,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:18:53,494 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:18:53,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:18:53,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:18:53,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:18:53,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:18:53,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:18:53,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:18:53,577 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:18:53,578 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:18:53,578 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-04 12:18:53,578 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-04 12:18:53,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:18:53,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:18:53,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:53,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:18:53,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:18:53,666 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,681 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:53,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:18:53,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:18:53,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:18:53,701 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,702 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,704 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,705 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,712 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,714 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,718 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 04.10 12:18:53" (1/1) ... [2018-10-04 12:18:53,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:18:53,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:18:53,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:18:53,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:18:53,728 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 04.10 12:18:53" (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:18:53,816 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:18:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:18:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:18:54,335 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:18:54,335 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 04.10 12:18:54 BoogieIcfgContainer [2018-10-04 12:18:54,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:18:54,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:18:54,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:18:54,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:18:54,340 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 04.10 12:18:53" (1/2) ... [2018-10-04 12:18:54,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70758cab 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 04.10 12:18:54, skipping insertion in model container [2018-10-04 12:18:54,341 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 04.10 12:18:54" (2/2) ... [2018-10-04 12:18:54,343 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 12:18:54,352 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:18:54,364 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:18:54,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:18:54,410 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:18:54,411 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:18:54,411 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:18:54,411 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:18:54,411 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:18:54,411 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:18:54,411 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:18:54,412 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:18:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:18:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:54,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:54,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:54,436 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:54,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 12:18:54,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:54,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:54,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:54,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:54,641 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:18:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:54,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:54,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:54,663 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 12:18:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:54,705 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-04 12:18:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:54,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:54,716 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:18:54,716 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:18:54,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:18:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:18:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:18:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:18:54,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-10-04 12:18:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:54,758 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:18:54,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:18:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:54,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:54,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:54,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:54,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2078913255, now seen corresponding path program 1 times [2018-10-04 12:18:54,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:54,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:54,852 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:18:54,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:54,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:54,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:54,856 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-10-04 12:18:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:54,903 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-10-04 12:18:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:54,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:54,905 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:18:54,905 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:18:54,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:18:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 12:18:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:18:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-10-04 12:18:54,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2018-10-04 12:18:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:54,916 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-10-04 12:18:54,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-10-04 12:18:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:54,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:54,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:54,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:54,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2136171557, now seen corresponding path program 1 times [2018-10-04 12:18:54,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:55,038 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:18:55,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:55,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:18:55,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:18:55,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:18:55,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:55,043 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 4 states. [2018-10-04 12:18:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:55,299 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-10-04 12:18:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:18:55,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:18:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:55,302 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:18:55,302 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:18:55,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:18:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2018-10-04 12:18:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:18:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-10-04 12:18:55,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 14 [2018-10-04 12:18:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:55,318 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-10-04 12:18:55,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:18:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-10-04 12:18:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:55,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:55,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:55,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:55,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2136111975, now seen corresponding path program 1 times [2018-10-04 12:18:55,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:55,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:55,464 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:18:55,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:55,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:18:55,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:18:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:18:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:55,466 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 4 states. [2018-10-04 12:18:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:55,743 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-10-04 12:18:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:18:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:18:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:55,745 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:18:55,745 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:18:55,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:18:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-10-04 12:18:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:18:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-10-04 12:18:55,757 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 14 [2018-10-04 12:18:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:55,758 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-10-04 12:18:55,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:18:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-10-04 12:18:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:55,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:55,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:55,760 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:55,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1820688235, now seen corresponding path program 1 times [2018-10-04 12:18:55,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:55,843 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:18:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:55,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:55,845 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-10-04 12:18:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:55,892 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-10-04 12:18:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:55,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:55,894 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:18:55,894 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:18:55,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:18:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:18:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:18:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-10-04 12:18:55,904 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2018-10-04 12:18:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:55,904 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-10-04 12:18:55,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-10-04 12:18:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:18:55,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:55,906 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-04 12:18:55,906 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:55,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1912016391, now seen corresponding path program 1 times [2018-10-04 12:18:55,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:55,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:56,014 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-04 12:18:56,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:56,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:18:56,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:56,016 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 3 states. [2018-10-04 12:18:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:56,078 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2018-10-04 12:18:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:56,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:18:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:56,081 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:18:56,081 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:18:56,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:18:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-04 12:18:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:18:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-10-04 12:18:56,107 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 26 [2018-10-04 12:18:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:56,108 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-10-04 12:18:56,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-10-04 12:18:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:18:56,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:56,112 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-04 12:18:56,112 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1573604279, now seen corresponding path program 1 times [2018-10-04 12:18:56,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:56,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:56,364 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-04 12:18:56,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:56,365 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:18:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:56,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:56,544 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-04 12:18:56,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:18:56,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:18:56,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:18:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:18:56,574 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 7 states. [2018-10-04 12:18:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:57,683 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-10-04 12:18:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:18:57,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 12:18:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:57,687 INFO L225 Difference]: With dead ends: 257 [2018-10-04 12:18:57,687 INFO L226 Difference]: Without dead ends: 153 [2018-10-04 12:18:57,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:18:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-04 12:18:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-10-04 12:18:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-04 12:18:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2018-10-04 12:18:57,724 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 26 [2018-10-04 12:18:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:57,724 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2018-10-04 12:18:57,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:18:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2018-10-04 12:18:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:18:57,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:57,727 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-04 12:18:57,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:57,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -53844841, now seen corresponding path program 2 times [2018-10-04 12:18:57,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:57,795 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-04 12:18:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:57,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:57,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:57,797 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand 3 states. [2018-10-04 12:18:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:57,805 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2018-10-04 12:18:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:57,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-04 12:18:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:57,806 INFO L225 Difference]: With dead ends: 145 [2018-10-04 12:18:57,806 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:18:57,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:18:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:18:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:18:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:18:57,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-04 12:18:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:57,809 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:18:57,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:18:57,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:18:57,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:18:57,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:18:58,246 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-04 12:18:58,378 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:18:58,667 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-04 12:18:58,772 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-10-04 12:18:58,847 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 316) no Hoare annotation was computed. [2018-10-04 12:18:58,847 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 315) no Hoare annotation was computed. [2018-10-04 12:18:58,848 INFO L421 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-10-04 12:18:58,848 INFO L421 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-04 12:18:58,849 INFO L421 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 (<= 1 ~mode3) .cse1) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-10-04 12:18:58,849 INFO L421 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-04 12:18:58,850 INFO L421 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-04 12:18:58,850 INFO L421 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-04 12:18:58,850 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 316) no Hoare annotation was computed. [2018-10-04 12:18:58,850 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 316) no Hoare annotation was computed. [2018-10-04 12:18:58,851 INFO L421 ceAbstractionStarter]: At program point L313(lines 192 313) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-10-04 12:18:58,851 INFO L421 ceAbstractionStarter]: At program point L214(lines 205 215) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-10-04 12:18:58,851 INFO L421 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 (<= 1 ~mode3) .cse1) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-10-04 12:18:58,851 INFO L421 ceAbstractionStarter]: At program point L307(lines 307 314) the Hoare annotation is: false [2018-10-04 12:18:58,852 INFO L421 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-04 12:18:58,852 INFO L421 ceAbstractionStarter]: At program point L198(lines 198 206) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-10-04 12:18:58,852 INFO L421 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-04 12:18:58,868 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 04.10 12:18:58 BoogieIcfgContainer [2018-10-04 12:18:58,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:58,870 INFO L168 Benchmark]: Toolchain (without parser) took 5225.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 245.8 MB). Peak memory consumption was 245.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:58,871 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:58,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:58,872 INFO L168 Benchmark]: Boogie Preprocessor took 33.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:58,873 INFO L168 Benchmark]: RCFGBuilder took 612.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:58,874 INFO L168 Benchmark]: TraceAbstraction took 4532.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:58,878 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 612.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4532.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.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: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new)) || (((~r1 <= 1 && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 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) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 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) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new)) || (((~r1 <= 1 && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 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, 4.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 191 SDslu, 201 SDs, 0 SdLazy, 116 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s 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, 1740 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 10626 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-58-895.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-58-895.csv Received shutdown request...