java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:49,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:49,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:49,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:49,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:49,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:49,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:49,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:49,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:49,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:49,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:49,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:49,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:49,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:49,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:49,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:49,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:49,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:49,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:49,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:49,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:49,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:49,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:49,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:49,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:49,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:49,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:49,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:49,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:49,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:49,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:49,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:49,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:49,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:49,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:49,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:49,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:53:49,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:49,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:49,694 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:49,694 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:49,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:49,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:49,695 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:49,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:49,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:49,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:49,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:49,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:49,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:49,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:49,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:49,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:49,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:49,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:49,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:49,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:49,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:49,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:49,699 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:49,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:49,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:49,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:49,771 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:49,772 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:49,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-24 14:53:49,837 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6ef1535a7/ef5ce35b57474f2ab173330321c5510f/FLAG8e42c5190 [2018-10-24 14:53:50,452 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:50,453 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-24 14:53:50,470 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6ef1535a7/ef5ce35b57474f2ab173330321c5510f/FLAG8e42c5190 [2018-10-24 14:53:50,486 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6ef1535a7/ef5ce35b57474f2ab173330321c5510f [2018-10-24 14:53:50,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:50,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:50,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:50,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:50,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:50,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:50" (1/1) ... [2018-10-24 14:53:50,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19392d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:50, skipping insertion in model container [2018-10-24 14:53:50,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:50" (1/1) ... [2018-10-24 14:53:50,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:50,619 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:51,366 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:51,371 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:51,691 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:51,713 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:51,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51 WrapperNode [2018-10-24 14:53:51,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:51,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:51,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:51,716 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:51,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:51,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:52,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:52,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:52,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:52,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:52,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:52,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:52,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:52,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:52,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-24 14:53:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:57,577 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:57,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:57 BoogieIcfgContainer [2018-10-24 14:53:57,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:57,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:57,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:57,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:57,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:50" (1/3) ... [2018-10-24 14:53:57,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4fbea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:57, skipping insertion in model container [2018-10-24 14:53:57,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51" (2/3) ... [2018-10-24 14:53:57,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4fbea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:57, skipping insertion in model container [2018-10-24 14:53:57,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:57" (3/3) ... [2018-10-24 14:53:57,587 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label07_true-unreach-call.c [2018-10-24 14:53:57,597 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:57,605 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:57,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:57,659 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:57,660 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:57,660 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:57,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:57,661 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:57,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:57,661 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:57,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:57,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 14:53:57,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:57,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:57,710 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:57,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 418458546, now seen corresponding path program 1 times [2018-10-24 14:53:57,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:57,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:58,767 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-24 14:53:58,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:58,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:58,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:58,799 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:54:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:02,518 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:54:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:02,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-24 14:54:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:02,552 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:54:02,552 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:54:02,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:54:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:54:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:54:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:54:02,651 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 173 [2018-10-24 14:54:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:02,652 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:54:02,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:54:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 14:54:02,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:02,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:02,662 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:02,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 72085267, now seen corresponding path program 1 times [2018-10-24 14:54:02,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:02,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:02,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:02,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:02,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:02,811 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:54:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:05,433 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:54:05,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:05,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-24 14:54:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:05,442 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:54:05,443 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:54:05,447 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-24 14:54:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:54:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:54:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:54:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:54:05,501 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 182 [2018-10-24 14:54:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:05,502 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:54:05,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:54:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 14:54:05,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:05,508 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:05,508 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:05,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2004095041, now seen corresponding path program 1 times [2018-10-24 14:54:05,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:05,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:05,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:05,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:05,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:05,769 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:54:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:08,879 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-10-24 14:54:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:08,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-24 14:54:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:08,894 INFO L225 Difference]: With dead ends: 3896 [2018-10-24 14:54:08,895 INFO L226 Difference]: Without dead ends: 2567 [2018-10-24 14:54:08,897 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-24 14:54:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-10-24 14:54:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-10-24 14:54:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-10-24 14:54:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-10-24 14:54:08,949 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 190 [2018-10-24 14:54:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:08,950 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-10-24 14:54:08,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-10-24 14:54:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 14:54:08,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:08,957 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:08,957 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:08,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 704749675, now seen corresponding path program 1 times [2018-10-24 14:54:08,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:08,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:09,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:09,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:09,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:09,212 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-10-24 14:54:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:10,753 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-10-24 14:54:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:10,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-24 14:54:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:10,768 INFO L225 Difference]: With dead ends: 5099 [2018-10-24 14:54:10,768 INFO L226 Difference]: Without dead ends: 2536 [2018-10-24 14:54:10,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-10-24 14:54:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-10-24 14:54:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-10-24 14:54:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-10-24 14:54:10,824 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 201 [2018-10-24 14:54:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:10,825 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-10-24 14:54:10,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-10-24 14:54:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:54:10,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:10,832 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:10,832 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:10,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1273453360, now seen corresponding path program 1 times [2018-10-24 14:54:10,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:11,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:11,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:11,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:11,139 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-10-24 14:54:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:13,911 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-10-24 14:54:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:13,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-24 14:54:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:13,945 INFO L225 Difference]: With dead ends: 10131 [2018-10-24 14:54:13,946 INFO L226 Difference]: Without dead ends: 7597 [2018-10-24 14:54:13,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-10-24 14:54:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-10-24 14:54:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-24 14:54:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-10-24 14:54:14,096 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 203 [2018-10-24 14:54:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:14,097 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-10-24 14:54:14,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-10-24 14:54:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 14:54:14,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:14,107 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:14,108 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:14,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2049995315, now seen corresponding path program 1 times [2018-10-24 14:54:14,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:14,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:54:14,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:14,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:14,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:14,252 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-10-24 14:54:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:15,706 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-10-24 14:54:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:15,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-24 14:54:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:15,730 INFO L225 Difference]: With dead ends: 15190 [2018-10-24 14:54:15,730 INFO L226 Difference]: Without dead ends: 7599 [2018-10-24 14:54:15,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-24 14:54:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-10-24 14:54:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-24 14:54:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-10-24 14:54:15,861 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 208 [2018-10-24 14:54:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:15,862 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-10-24 14:54:15,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-10-24 14:54:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:54:15,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:15,869 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:15,869 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:15,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1773650990, now seen corresponding path program 1 times [2018-10-24 14:54:15,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:15,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:15,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:16,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:16,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:16,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:16,013 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-10-24 14:54:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:18,247 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-10-24 14:54:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:18,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-24 14:54:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:18,313 INFO L225 Difference]: With dead ends: 22543 [2018-10-24 14:54:18,314 INFO L226 Difference]: Without dead ends: 14952 [2018-10-24 14:54:18,323 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-24 14:54:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-10-24 14:54:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-10-24 14:54:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-24 14:54:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-10-24 14:54:18,538 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 225 [2018-10-24 14:54:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:18,538 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-10-24 14:54:18,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-10-24 14:54:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 14:54:18,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:18,549 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:18,549 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:18,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1682463316, now seen corresponding path program 1 times [2018-10-24 14:54:18,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:18,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:18,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:18,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:18,747 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-10-24 14:54:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,041 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-10-24 14:54:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:20,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-10-24 14:54:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:20,070 INFO L225 Difference]: With dead ends: 29884 [2018-10-24 14:54:20,070 INFO L226 Difference]: Without dead ends: 14943 [2018-10-24 14:54:20,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-10-24 14:54:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-10-24 14:54:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-24 14:54:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-10-24 14:54:20,263 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 228 [2018-10-24 14:54:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:20,263 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-10-24 14:54:20,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-10-24 14:54:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 14:54:20,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:20,275 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:20,275 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:20,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1318810977, now seen corresponding path program 1 times [2018-10-24 14:54:20,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:54:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:20,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:20,436 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-10-24 14:54:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:21,970 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-10-24 14:54:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:21,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-24 14:54:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:22,013 INFO L225 Difference]: With dead ends: 37363 [2018-10-24 14:54:22,013 INFO L226 Difference]: Without dead ends: 22422 [2018-10-24 14:54:22,030 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-24 14:54:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-10-24 14:54:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-10-24 14:54:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-10-24 14:54:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-10-24 14:54:22,530 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 237 [2018-10-24 14:54:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,531 INFO L481 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-10-24 14:54:22,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-10-24 14:54:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 14:54:22,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,549 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:22,549 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -757390539, now seen corresponding path program 1 times [2018-10-24 14:54:22,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:22,904 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:54:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:54:23,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:23,093 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-24 14:54:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:23,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:54:23,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:23,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:54:23,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:23,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:23,502 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-10-24 14:54:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:30,641 INFO L93 Difference]: Finished difference Result 130790 states and 153530 transitions. [2018-10-24 14:54:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:54:30,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-10-24 14:54:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:30,864 INFO L225 Difference]: With dead ends: 130790 [2018-10-24 14:54:30,864 INFO L226 Difference]: Without dead ends: 108375 [2018-10-24 14:54:31,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:54:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108375 states. [2018-10-24 14:54:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108375 to 106497. [2018-10-24 14:54:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106497 states. [2018-10-24 14:54:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106497 states to 106497 states and 119844 transitions. [2018-10-24 14:54:32,733 INFO L78 Accepts]: Start accepts. Automaton has 106497 states and 119844 transitions. Word has length 245 [2018-10-24 14:54:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:32,733 INFO L481 AbstractCegarLoop]: Abstraction has 106497 states and 119844 transitions. [2018-10-24 14:54:32,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 106497 states and 119844 transitions. [2018-10-24 14:54:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-24 14:54:32,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:32,801 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:32,801 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:32,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 778143398, now seen corresponding path program 1 times [2018-10-24 14:54:32,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:32,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:54:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:33,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:33,224 INFO L87 Difference]: Start difference. First operand 106497 states and 119844 transitions. Second operand 4 states. [2018-10-24 14:54:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:37,218 INFO L93 Difference]: Finished difference Result 352610 states and 394075 transitions. [2018-10-24 14:54:37,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:37,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-24 14:54:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:37,563 INFO L225 Difference]: With dead ends: 352610 [2018-10-24 14:54:37,563 INFO L226 Difference]: Without dead ends: 246115 [2018-10-24 14:54:37,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246115 states. [2018-10-24 14:54:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246115 to 184592. [2018-10-24 14:54:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184592 states. [2018-10-24 14:54:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184592 states to 184592 states and 204846 transitions. [2018-10-24 14:54:41,202 INFO L78 Accepts]: Start accepts. Automaton has 184592 states and 204846 transitions. Word has length 315 [2018-10-24 14:54:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:41,203 INFO L481 AbstractCegarLoop]: Abstraction has 184592 states and 204846 transitions. [2018-10-24 14:54:41,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 184592 states and 204846 transitions. [2018-10-24 14:54:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-24 14:54:41,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:41,249 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:41,249 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:41,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1158786570, now seen corresponding path program 1 times [2018-10-24 14:54:41,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:41,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:54:41,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:41,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:41,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:41,713 INFO L87 Difference]: Start difference. First operand 184592 states and 204846 transitions. Second operand 3 states. [2018-10-24 14:54:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:44,151 INFO L93 Difference]: Finished difference Result 430750 states and 479158 transitions. [2018-10-24 14:54:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:44,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-24 14:54:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:44,469 INFO L225 Difference]: With dead ends: 430750 [2018-10-24 14:54:44,469 INFO L226 Difference]: Without dead ends: 246160 [2018-10-24 14:54:44,613 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-24 14:54:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246160 states. [2018-10-24 14:54:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246160 to 234843. [2018-10-24 14:54:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234843 states. [2018-10-24 14:54:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234843 states to 234843 states and 262264 transitions. [2018-10-24 14:54:48,842 INFO L78 Accepts]: Start accepts. Automaton has 234843 states and 262264 transitions. Word has length 330 [2018-10-24 14:54:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:48,842 INFO L481 AbstractCegarLoop]: Abstraction has 234843 states and 262264 transitions. [2018-10-24 14:54:48,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 234843 states and 262264 transitions. [2018-10-24 14:54:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-24 14:54:50,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:50,458 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:50,458 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:50,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1828150633, now seen corresponding path program 1 times [2018-10-24 14:54:50,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:50,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 14:54:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:50,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:50,674 INFO L87 Difference]: Start difference. First operand 234843 states and 262264 transitions. Second operand 3 states. [2018-10-24 14:54:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:52,599 INFO L93 Difference]: Finished difference Result 469669 states and 524511 transitions. [2018-10-24 14:54:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:52,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-10-24 14:54:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:52,915 INFO L225 Difference]: With dead ends: 469669 [2018-10-24 14:54:52,915 INFO L226 Difference]: Without dead ends: 234828 [2018-10-24 14:54:53,052 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-24 14:54:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234828 states. [2018-10-24 14:55:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234828 to 234828. [2018-10-24 14:55:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234828 states. [2018-10-24 14:55:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234828 states to 234828 states and 262234 transitions. [2018-10-24 14:55:02,186 INFO L78 Accepts]: Start accepts. Automaton has 234828 states and 262234 transitions. Word has length 336 [2018-10-24 14:55:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:02,187 INFO L481 AbstractCegarLoop]: Abstraction has 234828 states and 262234 transitions. [2018-10-24 14:55:02,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 234828 states and 262234 transitions. [2018-10-24 14:55:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-24 14:55:02,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:02,237 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:02,237 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:02,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 312285425, now seen corresponding path program 1 times [2018-10-24 14:55:02,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:02,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:55:03,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:03,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:03,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:03,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:03,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:03,256 INFO L87 Difference]: Start difference. First operand 234828 states and 262234 transitions. Second operand 3 states. [2018-10-24 14:55:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:06,647 INFO L93 Difference]: Finished difference Result 457996 states and 511131 transitions. [2018-10-24 14:55:06,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:06,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-24 14:55:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:06,970 INFO L225 Difference]: With dead ends: 457996 [2018-10-24 14:55:06,970 INFO L226 Difference]: Without dead ends: 223170 [2018-10-24 14:55:07,118 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-24 14:55:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223170 states. [2018-10-24 14:55:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223170 to 213295. [2018-10-24 14:55:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213295 states. [2018-10-24 14:55:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213295 states to 213295 states and 231973 transitions. [2018-10-24 14:55:11,088 INFO L78 Accepts]: Start accepts. Automaton has 213295 states and 231973 transitions. Word has length 347 [2018-10-24 14:55:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:11,089 INFO L481 AbstractCegarLoop]: Abstraction has 213295 states and 231973 transitions. [2018-10-24 14:55:11,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 213295 states and 231973 transitions. [2018-10-24 14:55:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-24 14:55:11,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:11,112 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:11,113 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:11,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1408009665, now seen corresponding path program 1 times [2018-10-24 14:55:11,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:11,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:11,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:11,720 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 14:55:12,180 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-24 14:55:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 14:55:12,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:55:12,504 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:55:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:12,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:55:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 14:55:13,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:55:13,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:55:13,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:55:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:55:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:13,699 INFO L87 Difference]: Start difference. First operand 213295 states and 231973 transitions. Second operand 6 states. [2018-10-24 14:55:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:20,816 INFO L93 Difference]: Finished difference Result 902872 states and 981569 transitions. [2018-10-24 14:55:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:55:20,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2018-10-24 14:55:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:21,688 INFO L225 Difference]: With dead ends: 902872 [2018-10-24 14:55:21,688 INFO L226 Difference]: Without dead ends: 689579 [2018-10-24 14:55:21,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689579 states. [2018-10-24 14:55:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689579 to 432775. [2018-10-24 14:55:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432775 states. [2018-10-24 14:55:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432775 states to 432775 states and 470790 transitions. [2018-10-24 14:55:30,583 INFO L78 Accepts]: Start accepts. Automaton has 432775 states and 470790 transitions. Word has length 362 [2018-10-24 14:55:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:30,583 INFO L481 AbstractCegarLoop]: Abstraction has 432775 states and 470790 transitions. [2018-10-24 14:55:30,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:55:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 432775 states and 470790 transitions. [2018-10-24 14:55:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-24 14:55:30,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:30,616 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:30,616 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:30,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash -185387452, now seen corresponding path program 1 times [2018-10-24 14:55:30,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:30,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 14:55:36,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:36,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:36,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:36,355 INFO L87 Difference]: Start difference. First operand 432775 states and 470790 transitions. Second operand 4 states. [2018-10-24 14:55:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:41,942 INFO L93 Difference]: Finished difference Result 874644 states and 951201 transitions. [2018-10-24 14:55:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:41,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-24 14:55:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:42,492 INFO L225 Difference]: With dead ends: 874644 [2018-10-24 14:55:42,492 INFO L226 Difference]: Without dead ends: 441871 [2018-10-24 14:55:42,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441871 states. [2018-10-24 14:55:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441871 to 441362. [2018-10-24 14:55:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441362 states. [2018-10-24 14:55:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441362 states to 441362 states and 478308 transitions. [2018-10-24 14:55:50,056 INFO L78 Accepts]: Start accepts. Automaton has 441362 states and 478308 transitions. Word has length 374 [2018-10-24 14:55:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:50,056 INFO L481 AbstractCegarLoop]: Abstraction has 441362 states and 478308 transitions. [2018-10-24 14:55:50,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 441362 states and 478308 transitions. [2018-10-24 14:55:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-24 14:55:50,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:50,123 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:50,123 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:50,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1184387920, now seen corresponding path program 1 times [2018-10-24 14:55:50,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-24 14:55:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:50,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:50,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:50,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:50,542 INFO L87 Difference]: Start difference. First operand 441362 states and 478308 transitions. Second operand 3 states. [2018-10-24 14:55:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:56,015 INFO L93 Difference]: Finished difference Result 912615 states and 988718 transitions. [2018-10-24 14:55:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:56,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-24 14:55:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:56,584 INFO L225 Difference]: With dead ends: 912615 [2018-10-24 14:55:56,585 INFO L226 Difference]: Without dead ends: 471255 [2018-10-24 14:55:56,772 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-24 14:55:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471255 states. [2018-10-24 14:56:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471255 to 457308. [2018-10-24 14:56:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457308 states. [2018-10-24 14:56:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457308 states to 457308 states and 495106 transitions. [2018-10-24 14:56:11,026 INFO L78 Accepts]: Start accepts. Automaton has 457308 states and 495106 transitions. Word has length 407 [2018-10-24 14:56:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:11,026 INFO L481 AbstractCegarLoop]: Abstraction has 457308 states and 495106 transitions. [2018-10-24 14:56:11,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 457308 states and 495106 transitions. [2018-10-24 14:56:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-24 14:56:11,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:11,070 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:11,070 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:11,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1886071870, now seen corresponding path program 1 times [2018-10-24 14:56:11,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:11,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:11,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 391 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 14:56:12,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:56:12,774 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:56:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:12,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:56:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 35 proven. 225 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-24 14:56:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:56:13,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-24 14:56:13,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:56:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:56:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:56:13,262 INFO L87 Difference]: Start difference. First operand 457308 states and 495106 transitions. Second operand 8 states. [2018-10-24 14:56:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:29,499 INFO L93 Difference]: Finished difference Result 1402132 states and 1509921 transitions. [2018-10-24 14:56:29,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 14:56:29,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 410 [2018-10-24 14:56:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:30,664 INFO L225 Difference]: With dead ends: 1402132 [2018-10-24 14:56:30,664 INFO L226 Difference]: Without dead ends: 944826 [2018-10-24 14:56:30,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-10-24 14:56:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944826 states. [2018-10-24 14:56:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944826 to 806296. [2018-10-24 14:56:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806296 states. [2018-10-24 14:57:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806296 states to 806296 states and 867766 transitions. [2018-10-24 14:57:00,870 INFO L78 Accepts]: Start accepts. Automaton has 806296 states and 867766 transitions. Word has length 410 [2018-10-24 14:57:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:00,871 INFO L481 AbstractCegarLoop]: Abstraction has 806296 states and 867766 transitions. [2018-10-24 14:57:00,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:57:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 806296 states and 867766 transitions. [2018-10-24 14:57:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-24 14:57:00,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:00,931 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:00,932 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:00,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1765344062, now seen corresponding path program 1 times [2018-10-24 14:57:00,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:00,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-10-24 14:57:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:01,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:01,589 INFO L87 Difference]: Start difference. First operand 806296 states and 867766 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 14:57:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:08,049 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:57:08,054 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:57:08,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:57:08 BoogieIcfgContainer [2018-10-24 14:57:08,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:57:08,055 INFO L168 Benchmark]: Toolchain (without parser) took 197557.26 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,057 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:57:08,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1214.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 299.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,059 INFO L168 Benchmark]: Boogie Preprocessor took 109.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,060 INFO L168 Benchmark]: RCFGBuilder took 5453.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 258.9 MB). Peak memory consumption was 258.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,060 INFO L168 Benchmark]: TraceAbstraction took 190474.82 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1214.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 299.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5453.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 258.9 MB). Peak memory consumption was 258.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190474.82 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1551]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (806296states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (867631 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 190.4s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 86.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4835 SDtfs, 17119 SDslu, 2883 SDs, 0 SdLazy, 22516 SolverSat, 4280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1112 GetRequests, 1052 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806296occurred in iteration=18, 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: 84.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 494425 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6392 ConstructedInterpolants, 0 QuantifiedInterpolants, 6435003 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1768 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 3848/4103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown