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.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:19:01,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:19:01,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:19:01,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:19:01,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:19:01,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:19:01,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:19:01,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:19:01,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:19:01,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:19:01,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:19:01,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:19:01,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:19:01,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:19:01,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:19:01,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:19:01,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:19:01,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:19:01,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:19:01,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:19:01,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:19:01,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:19:01,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:19:01,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:19:01,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:19:01,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:19:01,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:19:01,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:19:01,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:19:01,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:19:01,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:19:01,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:19:01,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:19:01,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:19:01,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:19:01,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:19:01,787 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:19:01,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:19:01,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:19:01,806 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:19:01,806 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:19:01,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:19:01,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:19:01,807 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:19:01,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:19:01,808 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:19:01,809 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:19:01,809 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:19:01,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:19:01,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:19:01,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:19:01,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:19:01,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:19:01,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:19:01,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:19:01,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:19:01,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:19:01,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:19:01,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:19:01,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:19:01,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:19:01,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:19:01,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:19:01,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:19:01,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:19:01,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:19:01,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:19:01,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:19:01,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:19:01,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:19:01,880 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:19:01,881 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:19:01,881 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.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-10-04 12:19:01,882 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl' [2018-10-04 12:19:01,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:19:01,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:19:01,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:19:01,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:19:01,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:19:01,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:19:02,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:19:02,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:19:02,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:19:02,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/1) ... [2018-10-04 12:19:02,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:19:02,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:19:02,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:19:02,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:19:02,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (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:19:02,168 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:19:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:19:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:19:02,720 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:19:02,720 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:19:02 BoogieIcfgContainer [2018-10-04 12:19:02,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:19:02,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:19:02,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:19:02,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:19:02,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:19:01" (1/2) ... [2018-10-04 12:19:02,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0e99e and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:19:02, skipping insertion in model container [2018-10-04 12:19:02,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:19:02" (2/2) ... [2018-10-04 12:19:02,729 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-10-04 12:19:02,738 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:19:02,746 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:19:02,796 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:19:02,797 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:19:02,797 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:19:02,797 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:19:02,797 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:19:02,797 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:19:02,798 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:19:02,798 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:19:02,798 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:19:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 12:19:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:02,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:02,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:02,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:02,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-10-04 12:19:02,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:02,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:02,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:02,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:02,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:03,112 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:19:03,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:03,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:03,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:03,135 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 12:19:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:03,201 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2018-10-04 12:19:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:03,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:19:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:03,214 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:19:03,214 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:19:03,218 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:19:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:19:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:19:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:19:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:19:03,259 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-10-04 12:19:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:03,259 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:19:03,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:19:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:03,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:03,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:03,261 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:03,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-10-04 12:19:03,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:03,368 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:19:03,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:03,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:03,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:03,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:03,371 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-10-04 12:19:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:03,394 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-10-04 12:19:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:03,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:19:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:03,396 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:19:03,396 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:19:03,397 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:19:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:19:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:19:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:19:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-04 12:19:03,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-10-04 12:19:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:03,403 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-04 12:19:03,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-04 12:19:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:03,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:03,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:03,405 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1686901289, now seen corresponding path program 1 times [2018-10-04 12:19:03,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:03,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:03,502 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:19:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:03,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:03,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:03,504 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2018-10-04 12:19:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:03,547 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-10-04 12:19:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:03,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:19:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:03,549 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:19:03,549 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:19:03,550 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:19:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:19:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:19:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:19:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-04 12:19:03,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2018-10-04 12:19:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:03,556 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-04 12:19:03,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-04 12:19:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:03,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:03,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:03,558 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:03,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2079928299, now seen corresponding path program 1 times [2018-10-04 12:19:03,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:03,670 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:19:03,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:03,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:03,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:03,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:03,672 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 3 states. [2018-10-04 12:19:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:03,712 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-10-04 12:19:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:03,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:19:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:03,714 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:19:03,714 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:19:03,715 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:19:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:19:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:19:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:19:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-04 12:19:03,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-04 12:19:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:03,722 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-04 12:19:03,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-04 12:19:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:03,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:03,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:03,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1270581673, now seen corresponding path program 1 times [2018-10-04 12:19:03,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:03,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:03,817 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:19:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:03,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:19:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:03,819 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 3 states. [2018-10-04 12:19:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:03,855 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-10-04 12:19:03,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:03,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:19:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:03,856 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:19:03,857 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:19:03,859 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:19:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:19:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-10-04 12:19:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:19:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-10-04 12:19:03,875 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2018-10-04 12:19:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:03,875 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-10-04 12:19:03,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-10-04 12:19:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:03,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:03,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:03,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:03,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1213323371, now seen corresponding path program 1 times [2018-10-04 12:19:03,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:03,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:03,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:04,016 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:19:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:19:04,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:19:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:19:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:19:04,021 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 4 states. [2018-10-04 12:19:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:04,139 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-10-04 12:19:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:19:04,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 12:19:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:04,141 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:19:04,141 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 12:19:04,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:19:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 12:19:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-10-04 12:19:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:19:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-10-04 12:19:04,152 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2018-10-04 12:19:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:04,153 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-10-04 12:19:04,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:19:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-10-04 12:19:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:19:04,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:04,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:04,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:04,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1213382953, now seen corresponding path program 1 times [2018-10-04 12:19:04,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:04,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:04,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:04,257 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:19:04,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:04,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:19:04,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:19:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:19:04,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:19:04,259 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 4 states. [2018-10-04 12:19:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:04,343 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-10-04 12:19:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:19:04,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 12:19:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:04,347 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:19:04,347 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:19:04,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:19:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:19:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-10-04 12:19:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:19:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-10-04 12:19:04,360 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 16 [2018-10-04 12:19:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:04,360 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-10-04 12:19:04,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:19:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-10-04 12:19:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:19:04,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:04,362 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:04,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:04,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1468461941, now seen corresponding path program 1 times [2018-10-04 12:19:04,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:04,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:19:04,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:19:04,590 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:19:04,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:19:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:19:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:19:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:19:04,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:19:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:19:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:19:04,947 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 6 states. [2018-10-04 12:19:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:06,142 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2018-10-04 12:19:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:19:06,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-10-04 12:19:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:06,147 INFO L225 Difference]: With dead ends: 157 [2018-10-04 12:19:06,147 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:19:06,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:19:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:19:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-10-04 12:19:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 12:19:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-10-04 12:19:06,187 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 30 [2018-10-04 12:19:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:06,188 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-10-04 12:19:06,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:19:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-10-04 12:19:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:19:06,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:19:06,190 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:19:06,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:19:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:19:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1126846763, now seen corresponding path program 2 times [2018-10-04 12:19:06,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:19:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:19:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:19:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:19:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:19:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:19:06,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:19:06,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:19:06,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:19:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:19:06,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:19:06,275 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 3 states. [2018-10-04 12:19:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:19:06,299 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-10-04 12:19:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:19:06,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:19:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:19:06,300 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:19:06,300 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:19:06,301 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:19:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:19:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:19:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:19:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:19:06,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-10-04 12:19:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:19:06,302 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:19:06,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:19:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:19:06,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:19:06,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:19:06,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:19:06,552 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 12:19:07,189 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-04 12:19:07,250 INFO L421 ceAbstractionStarter]: At program point L287(lines 280 288) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0))) [2018-10-04 12:19:07,251 INFO L421 ceAbstractionStarter]: At program point L316(lines 316 325) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse3 (not (= ~p3_new ~nomsg)))) (or (and .cse0 (<= 1 ~mode4) (<= ~r1 1) .cse1) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse2 .cse0 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1) (and .cse2 .cse3 (<= (+ ~mode4 256) 0)))) [2018-10-04 12:19:07,251 INFO L421 ceAbstractionStarter]: At program point L250(lines 250 262) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (<= (+ ~mode3 257) 0) (<= (+ ~mode1 256) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2)) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))))) [2018-10-04 12:19:07,251 INFO L421 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-10-04 12:19:07,252 INFO L421 ceAbstractionStarter]: At program point L267(lines 261 268) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2))) [2018-10-04 12:19:07,252 INFO L421 ceAbstractionStarter]: At program point L292(lines 292 302) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0))) [2018-10-04 12:19:07,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 61 391) no Hoare annotation was computed. [2018-10-04 12:19:07,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 61 391) no Hoare annotation was computed. [2018-10-04 12:19:07,252 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 281) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2))) [2018-10-04 12:19:07,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-10-04 12:19:07,253 INFO L421 ceAbstractionStarter]: At program point L363(lines 363 370) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-10-04 12:19:07,253 INFO L421 ceAbstractionStarter]: At program point L388(lines 388 389) the Hoare annotation is: false [2018-10-04 12:19:07,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 61 391) no Hoare annotation was computed. [2018-10-04 12:19:07,254 INFO L421 ceAbstractionStarter]: At program point L331(lines 324 332) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_new ~nomsg))) [2018-10-04 12:19:07,254 INFO L421 ceAbstractionStarter]: At program point L356(lines 352 357) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-10-04 12:19:07,254 INFO L421 ceAbstractionStarter]: At program point L385(lines 244 385) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (<= (+ ~mode3 257) 0) (<= (+ ~mode1 256) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2)) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))))) [2018-10-04 12:19:07,254 INFO L421 ceAbstractionStarter]: At program point L377(lines 377 386) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))) [2018-10-04 12:19:07,255 INFO L421 ceAbstractionStarter]: At program point L311(lines 301 312) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse3 (not (= ~p3_new ~nomsg)))) (or (and .cse0 (<= 1 ~mode4) (<= ~r1 1) .cse1) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse2 .cse0 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1) (and .cse2 .cse3 (<= (+ ~mode4 256) 0)))) [2018-10-04 12:19:07,255 INFO L421 ceAbstractionStarter]: At program point L373(lines 369 374) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))) [2018-10-04 12:19:07,273 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:19:07 BoogieIcfgContainer [2018-10-04 12:19:07,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:19:07,274 INFO L168 Benchmark]: Toolchain (without parser) took 5305.51 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: 266.9 MB). Peak memory consumption was 266.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:19:07,275 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:19:07,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:19:07,276 INFO L168 Benchmark]: Boogie Preprocessor took 60.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:19:07,277 INFO L168 Benchmark]: RCFGBuilder took 638.75 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 12:19:07,278 INFO L168 Benchmark]: TraceAbstraction took 4551.33 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: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:19:07,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.33 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.75 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 4551.33 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: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 352]: Loop Invariant Derived loop invariant: ((1 <= check_~tmp~101 && ~r1 <= 0) && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode1 + 256 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (~r1 <= 0 && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && !(~p3_new == ~nomsg)) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg))) || ((~r1 <= 0 && !(~p3_new == ~nomsg)) && ~mode4 + 256 <= 0) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode1 + 256 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (~r1 <= 0 && 1 <= ~mode4) && !(~p3_new == ~nomsg) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && !(~p3_new == ~nomsg)) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg))) || ((~r1 <= 0 && !(~p3_new == ~nomsg)) && ~mode4 + 256 <= 0) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 149 SDslu, 276 SDs, 0 SdLazy, 147 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 47 NumberOfFragments, 432 HoareAnnotationTreeSize, 15 FomulaSimplifications, 409 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 150 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 10624 SizeOfPredicates, 1 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 60/70 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.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-19-07-300.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-19-07-300.csv Received shutdown request...