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.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:40:51,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:40:51,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:40:51,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:40:51,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:40:51,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:40:51,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:40:51,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:40:51,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:40:51,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:40:51,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:40:51,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:40:51,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:40:51,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:40:51,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:40:51,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:40:51,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:40:51,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:40:51,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:40:51,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:40:51,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:40:51,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:40:51,494 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:40:51,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:40:51,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:40:51,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:40:51,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:40:51,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:40:51,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:40:51,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:40:51,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:40:51,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:40:51,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:40:51,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:40:51,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:40:51,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:40:51,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:40:51,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:40:51,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:40:51,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:40:51,518 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:40:51,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:40:51,519 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:40:51,519 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:40:51,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:40:51,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:40:51,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:40:51,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:40:51,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:40:51,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:40:51,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:40:51,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:40:51,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:40:51,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:40:51,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:40:51,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:40:51,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:40:51,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:40:51,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:40:51,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:51,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:40:51,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:40:51,524 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:40:51,524 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:40:51,524 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:40:51,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:40:51,525 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:40:51,525 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:40:51,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:40:51,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:40:51,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:40:51,608 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:40:51,608 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:40:51,609 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.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 09:40:51,609 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-10-04 09:40:51,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:40:51,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:40:51,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:51,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:40:51,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:40:51,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:51,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:40:51,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:40:51,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:40:51,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/1) ... [2018-10-04 09:40:51,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:40:51,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:40:51,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:40:51,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:40:51,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (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 09:40:51,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:40:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:40:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:40:52,396 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:40:52,397 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:40:52 BoogieIcfgContainer [2018-10-04 09:40:52,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:40:52,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:40:52,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:40:52,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:40:52,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:51" (1/2) ... [2018-10-04 09:40:52,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf0e9f and model type pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:40:52, skipping insertion in model container [2018-10-04 09:40:52,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:40:52" (2/2) ... [2018-10-04 09:40:52,405 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 09:40:52,415 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:40:52,423 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:40:52,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:40:52,474 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:40:52,474 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:40:52,474 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:40:52,475 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:40:52,475 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:40:52,475 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:40:52,475 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:40:52,475 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:40:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 09:40:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:40:52,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:52,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:52,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:52,507 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027093, now seen corresponding path program 1 times [2018-10-04 09:40:52,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:52,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:52,761 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 09:40:52,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:52,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:52,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:52,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:52,789 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 09:40:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:52,842 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-04 09:40:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:52,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:40:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:52,857 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:40:52,857 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:40:52,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:40:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-04 09:40:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:40:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-04 09:40:52,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-04 09:40:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:52,900 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-04 09:40:52,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 09:40:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:40:52,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:52,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:52,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:52,901 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1013680467, now seen corresponding path program 1 times [2018-10-04 09:40:52,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:52,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:52,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:53,027 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 09:40:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:40:53,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:40:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:40:53,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:53,033 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-10-04 09:40:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:53,175 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2018-10-04 09:40:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:40:53,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 09:40:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:53,178 INFO L225 Difference]: With dead ends: 83 [2018-10-04 09:40:53,178 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:40:53,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 09:40:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:40:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2018-10-04 09:40:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:40:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-10-04 09:40:53,200 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2018-10-04 09:40:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:53,201 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-10-04 09:40:53,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:40:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-10-04 09:40:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:40:53,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:53,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:53,203 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:53,203 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1013740049, now seen corresponding path program 1 times [2018-10-04 09:40:53,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:53,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:53,333 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 09:40:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:40:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:40:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:40:53,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:53,336 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 4 states. [2018-10-04 09:40:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:53,489 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-10-04 09:40:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:40:53,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 09:40:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:53,497 INFO L225 Difference]: With dead ends: 75 [2018-10-04 09:40:53,499 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 09:40:53,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:40:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 09:40:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 35. [2018-10-04 09:40:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:40:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-10-04 09:40:53,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2018-10-04 09:40:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:53,526 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-10-04 09:40:53,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:40:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-10-04 09:40:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:40:53,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:53,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:53,531 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:53,532 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash 956422165, now seen corresponding path program 1 times [2018-10-04 09:40:53,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:53,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:53,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:53,600 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 09:40:53,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:53,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:53,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:53,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:53,601 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 3 states. [2018-10-04 09:40:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:53,638 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2018-10-04 09:40:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:53,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:40:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:53,640 INFO L225 Difference]: With dead ends: 93 [2018-10-04 09:40:53,640 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:40:53,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:40:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 09:40:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:40:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-10-04 09:40:53,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 14 [2018-10-04 09:40:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:53,670 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-10-04 09:40:53,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-10-04 09:40:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:40:53,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:53,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:53,672 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:53,672 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1214587603, now seen corresponding path program 1 times [2018-10-04 09:40:53,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:53,757 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 09:40:53,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:53,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:53,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:53,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:53,758 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 3 states. [2018-10-04 09:40:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:53,784 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-10-04 09:40:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:53,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:40:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:53,785 INFO L225 Difference]: With dead ends: 95 [2018-10-04 09:40:53,786 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 09:40:53,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 09:40:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 09:40:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 09:40:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2018-10-04 09:40:53,802 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 14 [2018-10-04 09:40:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:53,802 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-10-04 09:40:53,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-10-04 09:40:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:40:53,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:53,804 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 09:40:53,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:53,804 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash -277256459, now seen corresponding path program 1 times [2018-10-04 09:40:53,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:53,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:53,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:53,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:53,915 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 09:40:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:40:53,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:53,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:53,918 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 3 states. [2018-10-04 09:40:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:53,995 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-10-04 09:40:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:54,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 09:40:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:54,001 INFO L225 Difference]: With dead ends: 121 [2018-10-04 09:40:54,001 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:40:54,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:40:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 09:40:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:40:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-10-04 09:40:54,027 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 26 [2018-10-04 09:40:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:54,027 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-10-04 09:40:54,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-10-04 09:40:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:40:54,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:54,029 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 09:40:54,029 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:54,029 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash 115770551, now seen corresponding path program 1 times [2018-10-04 09:40:54,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:54,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:54,174 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 09:40:54,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:54,175 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 09:40:54,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:54,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:54,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 09:40:54,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:54,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:40:54,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:40:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:40:54,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:54,570 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 7 states. [2018-10-04 09:40:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:55,235 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-10-04 09:40:55,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:40:55,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 09:40:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:55,236 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:40:55,237 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:40:55,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 8 [2018-10-04 09:40:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:40:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:40:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:40:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:40:55,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-04 09:40:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:55,239 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:40:55,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:40:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:40:55,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:40:55,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:40:56,026 WARN L178 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-04 09:40:56,233 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-04 09:40:56,344 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-04 09:40:56,569 INFO L421 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= (+ ~p1_old 1) 0)) (not (= 0 ULTIMATE.start_assert_~arg)) .cse0 (<= ~mode2 1) (<= ~r1 1)))) [2018-10-04 09:40:56,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:40:56,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-10-04 09:40:56,570 INFO L421 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1))) [2018-10-04 09:40:56,570 INFO L421 ceAbstractionStarter]: At program point L312(lines 193 312) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p1_old 1) 0)) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) .cse1 (<= ~mode2 1)) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-10-04 09:40:56,571 INFO L421 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-10-04 09:40:56,571 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 313) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-10-04 09:40:56,571 INFO L421 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-10-04 09:40:56,571 INFO L421 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p1_old 1) 0)) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) .cse1 (<= ~mode2 1)) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-10-04 09:40:56,572 INFO L421 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_main_~c1~83)) [2018-10-04 09:40:56,572 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:40:56,572 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:40:56,572 INFO L421 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= (+ ~p1_old 1) 0)) (not (= 0 ULTIMATE.start_assert_~arg)) .cse0 (<= ~mode2 1) (<= ~r1 1)))) [2018-10-04 09:40:56,572 INFO L421 ceAbstractionStarter]: At program point L315(lines 315 316) the Hoare annotation is: false [2018-10-04 09:40:56,573 INFO L421 ceAbstractionStarter]: At program point L245(lines 245 255) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-10-04 09:40:56,573 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1))) [2018-10-04 09:40:56,573 INFO L421 ceAbstractionStarter]: At program point L260(lines 254 261) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-10-04 09:40:56,590 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:40:56 BoogieIcfgContainer [2018-10-04 09:40:56,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:40:56,591 INFO L168 Benchmark]: Toolchain (without parser) took 4909.17 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 09:40:56,593 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:56,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:56,594 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:56,595 INFO L168 Benchmark]: RCFGBuilder took 638.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:40:56,596 INFO L168 Benchmark]: TraceAbstraction took 4191.58 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: 182.4 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:40:56,602 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 638.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4191.58 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: 182.4 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 317]: 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: 234]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((!(~p1_old + 1 == 0) && ~r1 <= 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(~p1_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) && ~r1 <= 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((!(~p1_old + 1 == 0) && ~r1 <= 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(~p1_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) && ~r1 <= 1) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && !(0 == assert_#in~arg) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= main_~c1~83 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && !(0 == assert_~arg)) && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && !(0 == assert_#in~arg) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 127 SDslu, 136 SDs, 0 SdLazy, 62 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 31 NumberOfFragments, 315 HoareAnnotationTreeSize, 13 FomulaSimplifications, 558 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 12366 SizeOfPredicates, 1 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 28/36 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.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-40-56-620.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-40-56-620.csv Received shutdown request...