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_label38_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:03:43,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:03:43,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:03:43,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:03:43,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:03:43,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:03:43,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:03:43,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:03:43,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:03:43,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:03:43,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:03:43,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:03:43,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:03:43,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:03:43,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:03:43,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:03:43,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:03:43,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:03:43,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:03:43,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:03:43,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:03:43,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:03:43,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:03:43,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:03:43,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:03:43,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:03:43,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:03:43,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:03:43,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:03:43,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:03:43,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:03:43,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:03:43,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:03:43,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:03:43,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:03:43,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:03:43,868 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-26 20:03:43,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:03:43,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:03:43,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:03:43,905 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:03:43,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:03:43,906 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:03:43,906 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:03:43,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:03:43,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:03:43,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:03:43,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:03:43,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:03:43,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:03:43,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:03:43,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:03:43,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:03:43,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:03:43,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:03:43,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:03:43,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:03:43,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:03:43,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:03:43,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:03:43,910 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:03:43,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:03:43,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:03:43,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:03:43,911 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:03:43,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:03:44,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:03:44,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:03:44,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:03:44,008 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:03:44,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-26 20:03:44,073 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72047f7b/aa6e7258698a4313a5519ca5419aad9a/FLAGff42afe04 [2018-10-26 20:03:44,821 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:03:44,822 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-26 20:03:44,846 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72047f7b/aa6e7258698a4313a5519ca5419aad9a/FLAGff42afe04 [2018-10-26 20:03:44,868 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72047f7b/aa6e7258698a4313a5519ca5419aad9a [2018-10-26 20:03:44,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:03:44,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:03:44,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:44,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:03:44,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:03:44,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:44" (1/1) ... [2018-10-26 20:03:44,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71739530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:44, skipping insertion in model container [2018-10-26 20:03:44,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:44" (1/1) ... [2018-10-26 20:03:44,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:03:44,996 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:03:45,751 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:45,758 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:03:46,064 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:46,087 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:03:46,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46 WrapperNode [2018-10-26 20:03:46,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:46,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:03:46,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:03:46,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:03:46,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:03:46,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:03:46,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:03:46,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:03:46,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (1/1) ... [2018-10-26 20:03:46,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:03:46,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:03:46,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:03:46,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:03:46,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (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-26 20:03:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:03:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:03:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:03:52,588 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:03:52,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:52 BoogieIcfgContainer [2018-10-26 20:03:52,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:03:52,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:03:52,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:03:52,595 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:03:52,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:03:44" (1/3) ... [2018-10-26 20:03:52,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1118089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:52, skipping insertion in model container [2018-10-26 20:03:52,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:46" (2/3) ... [2018-10-26 20:03:52,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1118089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:52, skipping insertion in model container [2018-10-26 20:03:52,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:52" (3/3) ... [2018-10-26 20:03:52,600 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38_true-unreach-call.c [2018-10-26 20:03:52,610 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:03:52,620 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:03:52,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:03:52,676 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:03:52,677 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:03:52,677 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:03:52,677 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:03:52,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:03:52,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:03:52,678 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:03:52,678 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:03:52,678 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:03:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:03:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 20:03:52,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,725 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, 1, 1, 1, 1, 1, 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-26 20:03:52,728 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1988565156, now seen corresponding path program 1 times [2018-10-26 20:03:52,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,631 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-26 20:03:53,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:53,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,664 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-26 20:03:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:56,210 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-26 20:03:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:56,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-26 20:03:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:56,237 INFO L225 Difference]: With dead ends: 832 [2018-10-26 20:03:56,238 INFO L226 Difference]: Without dead ends: 525 [2018-10-26 20:03:56,244 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-26 20:03:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-26 20:03:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-26 20:03:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-26 20:03:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-26 20:03:56,334 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 202 [2018-10-26 20:03:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:56,335 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-26 20:03:56,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-26 20:03:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 20:03:56,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:56,343 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:03:56,344 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:56,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 170905101, now seen corresponding path program 1 times [2018-10-26 20:03:56,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:56,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:56,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:56,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:56,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:56,737 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-26 20:04:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:01,393 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-10-26 20:04:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:01,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-10-26 20:04:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:01,404 INFO L225 Difference]: With dead ends: 1893 [2018-10-26 20:04:01,404 INFO L226 Difference]: Without dead ends: 1384 [2018-10-26 20:04:01,408 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-26 20:04:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-10-26 20:04:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-10-26 20:04:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-26 20:04:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-26 20:04:01,475 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 208 [2018-10-26 20:04:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:01,475 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-26 20:04:01,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-26 20:04:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-26 20:04:01,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:01,483 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:01,483 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:01,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash -461514232, now seen corresponding path program 1 times [2018-10-26 20:04:01,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:01,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:01,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:01,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:01,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:01,826 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-26 20:04:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:03,820 INFO L93 Difference]: Finished difference Result 2673 states and 4433 transitions. [2018-10-26 20:04:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:03,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-26 20:04:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:03,832 INFO L225 Difference]: With dead ends: 2673 [2018-10-26 20:04:03,833 INFO L226 Difference]: Without dead ends: 1752 [2018-10-26 20:04:03,835 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-26 20:04:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-26 20:04:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1751. [2018-10-26 20:04:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-26 20:04:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-26 20:04:03,870 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 210 [2018-10-26 20:04:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:03,871 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-26 20:04:03,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-26 20:04:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 20:04:03,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:03,877 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:03,877 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:03,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -675094169, now seen corresponding path program 1 times [2018-10-26 20:04:03,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:03,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 20:04:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:04:04,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:04,064 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-26 20:04:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:05,646 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-26 20:04:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:05,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-26 20:04:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:05,661 INFO L225 Difference]: With dead ends: 4329 [2018-10-26 20:04:05,661 INFO L226 Difference]: Without dead ends: 2580 [2018-10-26 20:04:05,665 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-26 20:04:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-26 20:04:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-26 20:04:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-26 20:04:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-26 20:04:05,771 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 219 [2018-10-26 20:04:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:05,771 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-26 20:04:05,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-26 20:04:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-26 20:04:05,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:05,781 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 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-26 20:04:05,781 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:05,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1924425440, now seen corresponding path program 1 times [2018-10-26 20:04:05,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:05,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:05,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:04:05,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:05,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:04:05,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:05,937 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-26 20:04:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:06,532 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-26 20:04:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:06,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-26 20:04:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:06,557 INFO L225 Difference]: With dead ends: 7713 [2018-10-26 20:04:06,557 INFO L226 Difference]: Without dead ends: 5136 [2018-10-26 20:04:06,562 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-26 20:04:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-26 20:04:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-26 20:04:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-26 20:04:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-26 20:04:06,663 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 225 [2018-10-26 20:04:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:06,663 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-26 20:04:06,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-26 20:04:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 20:04:06,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:06,676 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:06,676 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:06,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash -942595079, now seen corresponding path program 1 times [2018-10-26 20:04:06,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:06,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:04:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:04:07,032 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-26 20:04:07,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:07,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:04:07,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:04:07,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 20:04:07,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:07,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:07,321 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-26 20:04:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:09,791 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-26 20:04:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:09,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-10-26 20:04:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:09,873 INFO L225 Difference]: With dead ends: 20487 [2018-10-26 20:04:09,873 INFO L226 Difference]: Without dead ends: 15356 [2018-10-26 20:04:09,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-26 20:04:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-26 20:04:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-26 20:04:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-26 20:04:10,143 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 234 [2018-10-26 20:04:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:10,143 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-26 20:04:10,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-26 20:04:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 20:04:10,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:10,166 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:10,166 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:10,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -42517928, now seen corresponding path program 1 times [2018-10-26 20:04:10,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:10,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:10,651 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:04:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:10,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:10,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:10,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:04:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:04:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:10,695 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-26 20:04:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:13,710 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-26 20:04:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:04:13,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-10-26 20:04:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:13,751 INFO L225 Difference]: With dead ends: 23029 [2018-10-26 20:04:13,752 INFO L226 Difference]: Without dead ends: 12802 [2018-10-26 20:04:13,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-26 20:04:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-26 20:04:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-26 20:04:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-26 20:04:13,983 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 242 [2018-10-26 20:04:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:13,983 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-26 20:04:13,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:04:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-26 20:04:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 20:04:14,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:14,006 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:14,007 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:14,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1670858200, now seen corresponding path program 1 times [2018-10-26 20:04:14,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 20:04:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:14,284 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-10-26 20:04:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:18,979 INFO L93 Difference]: Finished difference Result 41024 states and 61360 transitions. [2018-10-26 20:04:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:18,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-26 20:04:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:19,050 INFO L225 Difference]: With dead ends: 41024 [2018-10-26 20:04:19,051 INFO L226 Difference]: Without dead ends: 29981 [2018-10-26 20:04:19,077 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-26 20:04:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29981 states. [2018-10-26 20:04:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29981 to 20440. [2018-10-26 20:04:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-26 20:04:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-10-26 20:04:19,479 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 242 [2018-10-26 20:04:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:19,480 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-10-26 20:04:19,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-10-26 20:04:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 20:04:19,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:19,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:19,516 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2012852909, now seen corresponding path program 1 times [2018-10-26 20:04:19,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:19,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:19,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:19,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:04:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:19,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:19,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:19,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:19,660 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-10-26 20:04:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:21,399 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-10-26 20:04:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:21,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-10-26 20:04:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:21,436 INFO L225 Difference]: With dead ends: 40906 [2018-10-26 20:04:21,436 INFO L226 Difference]: Without dead ends: 20468 [2018-10-26 20:04:21,466 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-26 20:04:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-10-26 20:04:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-10-26 20:04:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-26 20:04:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-10-26 20:04:21,794 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 243 [2018-10-26 20:04:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:21,795 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-10-26 20:04:21,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-10-26 20:04:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-26 20:04:21,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:21,832 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:21,832 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:21,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1161717019, now seen corresponding path program 1 times [2018-10-26 20:04:21,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 20:04:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:22,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:22,005 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-10-26 20:04:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:23,771 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-10-26 20:04:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:23,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-10-26 20:04:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:23,823 INFO L225 Difference]: With dead ends: 57404 [2018-10-26 20:04:23,823 INFO L226 Difference]: Without dead ends: 36966 [2018-10-26 20:04:23,851 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-26 20:04:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-10-26 20:04:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-10-26 20:04:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-10-26 20:04:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-10-26 20:04:24,369 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 250 [2018-10-26 20:04:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:24,370 INFO L481 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-10-26 20:04:24,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-10-26 20:04:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-26 20:04:24,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:24,403 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:24,403 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:24,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -50667516, now seen corresponding path program 1 times [2018-10-26 20:04:24,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:24,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:24,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:24,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 20:04:24,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:04:24,778 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-26 20:04:24,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:24,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:04:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:04:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-10-26 20:04:25,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:04:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:04:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:04:25,062 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 7 states. [2018-10-26 20:04:25,403 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 20:04:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:31,750 INFO L93 Difference]: Finished difference Result 148408 states and 179941 transitions. [2018-10-26 20:04:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:04:31,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-10-26 20:04:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:31,880 INFO L225 Difference]: With dead ends: 148408 [2018-10-26 20:04:31,880 INFO L226 Difference]: Without dead ends: 111452 [2018-10-26 20:04:31,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:04:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111452 states. [2018-10-26 20:04:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111452 to 111428. [2018-10-26 20:04:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111428 states. [2018-10-26 20:04:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111428 states to 111428 states and 129315 transitions. [2018-10-26 20:04:33,556 INFO L78 Accepts]: Start accepts. Automaton has 111428 states and 129315 transitions. Word has length 273 [2018-10-26 20:04:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:33,556 INFO L481 AbstractCegarLoop]: Abstraction has 111428 states and 129315 transitions. [2018-10-26 20:04:33,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 111428 states and 129315 transitions. [2018-10-26 20:04:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-26 20:04:33,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:33,616 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:04:33,617 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:33,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -996362106, now seen corresponding path program 1 times [2018-10-26 20:04:33,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:33,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:33,923 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:04:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 20:04:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:34,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:34,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:34,007 INFO L87 Difference]: Start difference. First operand 111428 states and 129315 transitions. Second operand 4 states. [2018-10-26 20:04:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:37,532 INFO L93 Difference]: Finished difference Result 351941 states and 407982 transitions. [2018-10-26 20:04:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:37,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-10-26 20:04:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:37,933 INFO L225 Difference]: With dead ends: 351941 [2018-10-26 20:04:37,933 INFO L226 Difference]: Without dead ends: 240515 [2018-10-26 20:04:39,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240515 states. [2018-10-26 20:04:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240515 to 177289. [2018-10-26 20:04:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177289 states. [2018-10-26 20:04:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177289 states to 177289 states and 203822 transitions. [2018-10-26 20:04:41,359 INFO L78 Accepts]: Start accepts. Automaton has 177289 states and 203822 transitions. Word has length 302 [2018-10-26 20:04:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:41,360 INFO L481 AbstractCegarLoop]: Abstraction has 177289 states and 203822 transitions. [2018-10-26 20:04:41,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 177289 states and 203822 transitions. [2018-10-26 20:04:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-26 20:04:41,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:41,453 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:04:41,453 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:41,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634105, now seen corresponding path program 1 times [2018-10-26 20:04:41,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:41,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:41,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:41,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:41,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:04:42,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:42,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:04:42,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:42,680 INFO L87 Difference]: Start difference. First operand 177289 states and 203822 transitions. Second operand 3 states. [2018-10-26 20:04:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:44,564 INFO L93 Difference]: Finished difference Result 354568 states and 407634 transitions. [2018-10-26 20:04:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:44,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-26 20:04:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:44,841 INFO L225 Difference]: With dead ends: 354568 [2018-10-26 20:04:44,841 INFO L226 Difference]: Without dead ends: 177281 [2018-10-26 20:04:44,971 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-26 20:04:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177281 states. [2018-10-26 20:04:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177281 to 177281. [2018-10-26 20:04:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177281 states. [2018-10-26 20:04:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177281 states to 177281 states and 203798 transitions. [2018-10-26 20:04:47,124 INFO L78 Accepts]: Start accepts. Automaton has 177281 states and 203798 transitions. Word has length 330 [2018-10-26 20:04:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:47,124 INFO L481 AbstractCegarLoop]: Abstraction has 177281 states and 203798 transitions. [2018-10-26 20:04:47,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 177281 states and 203798 transitions. [2018-10-26 20:04:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-26 20:04:47,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:47,216 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1] [2018-10-26 20:04:47,216 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:47,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1310769329, now seen corresponding path program 1 times [2018-10-26 20:04:47,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:47,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:47,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:04:48,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:48,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:04:48,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:48,646 INFO L87 Difference]: Start difference. First operand 177281 states and 203798 transitions. Second operand 3 states. [2018-10-26 20:04:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:51,281 INFO L93 Difference]: Finished difference Result 350124 states and 402284 transitions. [2018-10-26 20:04:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:51,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-10-26 20:04:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:51,486 INFO L225 Difference]: With dead ends: 350124 [2018-10-26 20:04:51,487 INFO L226 Difference]: Without dead ends: 172845 [2018-10-26 20:04:51,587 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-26 20:04:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172845 states. [2018-10-26 20:04:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172845 to 172845. [2018-10-26 20:04:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172845 states. [2018-10-26 20:04:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172845 states to 172845 states and 196910 transitions. [2018-10-26 20:04:55,221 INFO L78 Accepts]: Start accepts. Automaton has 172845 states and 196910 transitions. Word has length 332 [2018-10-26 20:04:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:55,221 INFO L481 AbstractCegarLoop]: Abstraction has 172845 states and 196910 transitions. [2018-10-26 20:04:55,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 172845 states and 196910 transitions. [2018-10-26 20:04:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-26 20:04:55,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:55,266 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:55,266 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:55,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1850297527, now seen corresponding path program 1 times [2018-10-26 20:04:55,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:55,657 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:04:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:55,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:55,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:55,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:55,751 INFO L87 Difference]: Start difference. First operand 172845 states and 196910 transitions. Second operand 4 states. [2018-10-26 20:04:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:59,140 INFO L93 Difference]: Finished difference Result 659659 states and 751671 transitions. [2018-10-26 20:04:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:59,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-10-26 20:04:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:06,215 INFO L225 Difference]: With dead ends: 659659 [2018-10-26 20:05:06,215 INFO L226 Difference]: Without dead ends: 486816 [2018-10-26 20:05:06,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486816 states. [2018-10-26 20:05:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486816 to 322964. [2018-10-26 20:05:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322964 states. [2018-10-26 20:05:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322964 states to 322964 states and 368236 transitions. [2018-10-26 20:05:11,928 INFO L78 Accepts]: Start accepts. Automaton has 322964 states and 368236 transitions. Word has length 345 [2018-10-26 20:05:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:11,928 INFO L481 AbstractCegarLoop]: Abstraction has 322964 states and 368236 transitions. [2018-10-26 20:05:11,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 322964 states and 368236 transitions. [2018-10-26 20:05:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-26 20:05:11,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:11,976 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:11,976 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:11,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash 972731471, now seen corresponding path program 1 times [2018-10-26 20:05:11,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:11,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 20:05:12,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:12,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:12,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:12,313 INFO L87 Difference]: Start difference. First operand 322964 states and 368236 transitions. Second operand 4 states. [2018-10-26 20:05:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:17,247 INFO L93 Difference]: Finished difference Result 663142 states and 756901 transitions. [2018-10-26 20:05:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:17,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-26 20:05:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:17,685 INFO L225 Difference]: With dead ends: 663142 [2018-10-26 20:05:17,685 INFO L226 Difference]: Without dead ends: 340180 [2018-10-26 20:05:17,804 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-26 20:05:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340180 states. [2018-10-26 20:05:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340180 to 340130. [2018-10-26 20:05:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340130 states. [2018-10-26 20:05:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340130 states to 340130 states and 387085 transitions. [2018-10-26 20:05:23,452 INFO L78 Accepts]: Start accepts. Automaton has 340130 states and 387085 transitions. Word has length 346 [2018-10-26 20:05:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:23,452 INFO L481 AbstractCegarLoop]: Abstraction has 340130 states and 387085 transitions. [2018-10-26 20:05:23,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 340130 states and 387085 transitions. [2018-10-26 20:05:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-26 20:05:23,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:23,510 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:23,510 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:23,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1494854117, now seen corresponding path program 1 times [2018-10-26 20:05:23,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:23,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:05:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:23,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:23,923 INFO L87 Difference]: Start difference. First operand 340130 states and 387085 transitions. Second operand 4 states. [2018-10-26 20:05:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:29,339 INFO L93 Difference]: Finished difference Result 696743 states and 795694 transitions. [2018-10-26 20:05:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:29,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-26 20:05:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:29,866 INFO L225 Difference]: With dead ends: 696743 [2018-10-26 20:05:29,866 INFO L226 Difference]: Without dead ends: 356615 [2018-10-26 20:05:30,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-26 20:05:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356615 states. [2018-10-26 20:05:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356615 to 339463. [2018-10-26 20:05:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339463 states. [2018-10-26 20:05:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339463 states to 339463 states and 383111 transitions. [2018-10-26 20:05:40,956 INFO L78 Accepts]: Start accepts. Automaton has 339463 states and 383111 transitions. Word has length 351 [2018-10-26 20:05:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:40,956 INFO L481 AbstractCegarLoop]: Abstraction has 339463 states and 383111 transitions. [2018-10-26 20:05:40,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 339463 states and 383111 transitions. [2018-10-26 20:05:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-26 20:05:41,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:41,025 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:41,025 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:41,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash -846916471, now seen corresponding path program 1 times [2018-10-26 20:05:41,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 20:05:41,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:41,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:41,281 INFO L87 Difference]: Start difference. First operand 339463 states and 383111 transitions. Second operand 3 states. [2018-10-26 20:05:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:45,629 INFO L93 Difference]: Finished difference Result 641129 states and 725196 transitions. [2018-10-26 20:05:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:45,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-10-26 20:05:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:46,032 INFO L225 Difference]: With dead ends: 641129 [2018-10-26 20:05:46,032 INFO L226 Difference]: Without dead ends: 301668 [2018-10-26 20:05:46,185 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-26 20:05:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301668 states. [2018-10-26 20:05:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301668 to 296960. [2018-10-26 20:05:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296960 states. [2018-10-26 20:05:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296960 states to 296960 states and 328199 transitions. [2018-10-26 20:05:51,018 INFO L78 Accepts]: Start accepts. Automaton has 296960 states and 328199 transitions. Word has length 368 [2018-10-26 20:05:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:51,019 INFO L481 AbstractCegarLoop]: Abstraction has 296960 states and 328199 transitions. [2018-10-26 20:05:51,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 296960 states and 328199 transitions. [2018-10-26 20:05:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-26 20:05:51,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:51,065 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 20:05:51,065 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:51,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash -893696450, now seen corresponding path program 1 times [2018-10-26 20:05:51,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:51,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-26 20:05:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:52,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:52,425 INFO L87 Difference]: Start difference. First operand 296960 states and 328199 transitions. Second operand 4 states. [2018-10-26 20:05:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:58,294 INFO L93 Difference]: Finished difference Result 1111747 states and 1228016 transitions. [2018-10-26 20:05:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:58,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-26 20:05:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:59,346 INFO L225 Difference]: With dead ends: 1111747 [2018-10-26 20:05:59,347 INFO L226 Difference]: Without dead ends: 814789 [2018-10-26 20:05:59,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814789 states. [2018-10-26 20:06:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814789 to 524785. [2018-10-26 20:06:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524785 states. [2018-10-26 20:06:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524785 states to 524785 states and 579152 transitions. [2018-10-26 20:06:17,622 INFO L78 Accepts]: Start accepts. Automaton has 524785 states and 579152 transitions. Word has length 374 [2018-10-26 20:06:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:17,622 INFO L481 AbstractCegarLoop]: Abstraction has 524785 states and 579152 transitions. [2018-10-26 20:06:17,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 524785 states and 579152 transitions. [2018-10-26 20:06:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-26 20:06:17,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:17,680 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 20:06:17,680 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:17,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1326023536, now seen corresponding path program 1 times [2018-10-26 20:06:17,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:17,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:17,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:17,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:17,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 20:06:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:06:19,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:19,497 INFO L87 Difference]: Start difference. First operand 524785 states and 579152 transitions. Second operand 4 states. [2018-10-26 20:06:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:26,203 INFO L93 Difference]: Finished difference Result 1050464 states and 1158599 transitions. [2018-10-26 20:06:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:26,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-10-26 20:06:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:26,850 INFO L225 Difference]: With dead ends: 1050464 [2018-10-26 20:06:26,850 INFO L226 Difference]: Without dead ends: 525681 [2018-10-26 20:06:27,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 20:06:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525681 states. [2018-10-26 20:06:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525681 to 505523. [2018-10-26 20:06:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505523 states. [2018-10-26 20:06:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505523 states to 505523 states and 554820 transitions. [2018-10-26 20:06:35,399 INFO L78 Accepts]: Start accepts. Automaton has 505523 states and 554820 transitions. Word has length 385 [2018-10-26 20:06:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,400 INFO L481 AbstractCegarLoop]: Abstraction has 505523 states and 554820 transitions. [2018-10-26 20:06:35,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 505523 states and 554820 transitions. [2018-10-26 20:06:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-26 20:06:35,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,458 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 20:06:35,458 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682089, now seen corresponding path program 1 times [2018-10-26 20:06:35,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 20:06:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:36,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:36,924 INFO L87 Difference]: Start difference. First operand 505523 states and 554820 transitions. Second operand 3 states. [2018-10-26 20:06:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:48,270 INFO L93 Difference]: Finished difference Result 921579 states and 1012002 transitions. [2018-10-26 20:06:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:48,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-10-26 20:06:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:48,797 INFO L225 Difference]: With dead ends: 921579 [2018-10-26 20:06:48,797 INFO L226 Difference]: Without dead ends: 416058 [2018-10-26 20:06:48,963 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-26 20:06:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416058 states. [2018-10-26 20:06:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416058 to 416042. [2018-10-26 20:06:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416042 states. [2018-10-26 20:06:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416042 states to 416042 states and 448273 transitions. [2018-10-26 20:06:55,578 INFO L78 Accepts]: Start accepts. Automaton has 416042 states and 448273 transitions. Word has length 391 [2018-10-26 20:06:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:55,578 INFO L481 AbstractCegarLoop]: Abstraction has 416042 states and 448273 transitions. [2018-10-26 20:06:55,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 416042 states and 448273 transitions. [2018-10-26 20:06:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-26 20:06:55,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:55,631 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:06:55,632 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:55,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1913922487, now seen corresponding path program 1 times [2018-10-26 20:06:55,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:06:55,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:55,903 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-26 20:06:55,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:56,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 20:06:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:06:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-26 20:06:56,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:56,187 INFO L87 Difference]: Start difference. First operand 416042 states and 448273 transitions. Second operand 4 states. [2018-10-26 20:07:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:03,975 INFO L93 Difference]: Finished difference Result 1155885 states and 1237531 transitions. [2018-10-26 20:07:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:03,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-26 20:07:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:05,276 INFO L225 Difference]: With dead ends: 1155885 [2018-10-26 20:07:05,277 INFO L226 Difference]: Without dead ends: 739845 [2018-10-26 20:07:05,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 397 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-26 20:07:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739845 states. Received shutdown request... [2018-10-26 20:07:08,509 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:07:08,514 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:07:08,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:07:08 BoogieIcfgContainer [2018-10-26 20:07:08,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:07:08,515 INFO L168 Benchmark]: Toolchain (without parser) took 203635.91 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.5 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-10-26 20:07:08,516 INFO L168 Benchmark]: CDTParser took 0.24 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-26 20:07:08,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1207.54 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-26 20:07:08,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 309.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -888.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:07:08,518 INFO L168 Benchmark]: Boogie Preprocessor took 110.27 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:07:08,519 INFO L168 Benchmark]: RCFGBuilder took 6075.22 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: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 7.1 GB. [2018-10-26 20:07:08,522 INFO L168 Benchmark]: TraceAbstraction took 195924.30 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2018-10-26 20:07:08,526 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.24 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 1207.54 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 309.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -888.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.27 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6075.22 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: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195924.30 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 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: 1638]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1638). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 195.8s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 106.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7238 SDtfs, 13509 SDslu, 6658 SDs, 0 SdLazy, 19145 SolverSat, 3804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 931 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524785occurred in iteration=19, 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: 74.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 576131 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 7371 NumberOfCodeBlocks, 7371 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7346 ConstructedInterpolants, 0 QuantifiedInterpolants, 3741598 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1684 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 3409/3429 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown