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_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:53:25,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:53:25,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:53:25,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:53:25,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:53:25,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:53:25,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:53:25,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:53:25,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:53:25,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:53:25,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:53:25,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:53:25,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:53:25,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:53:25,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:53:25,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:53:25,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:53:25,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:53:25,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:53:25,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:53:25,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:53:25,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:53:25,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:53:25,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:53:25,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:53:25,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:53:25,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:53:25,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:53:25,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:53:25,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:53:25,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:53:25,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:53:25,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:53:25,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:53:25,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:53:25,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:53:25,758 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-23 18:53:25,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:53:25,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:53:25,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:53:25,778 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:53:25,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:53:25,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:53:25,779 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:53:25,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:53:25,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:53:25,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:53:25,780 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:53:25,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:53:25,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:53:25,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:53:25,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:53:25,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:53:25,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:53:25,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:53:25,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:53:25,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:25,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:53:25,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:53:25,783 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:53:25,783 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:53:25,784 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:53:25,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:53:25,784 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:53:25,785 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:53:25,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:53:25,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:53:25,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:53:25,869 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:53:25,870 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:53:25,870 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label23_true-unreach-call.c [2018-10-23 18:53:25,940 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d32425ea/82ca0e14a08045299c6ab9a837cd9d60/FLAG50256c98d [2018-10-23 18:53:26,569 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:53:26,570 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label23_true-unreach-call.c [2018-10-23 18:53:26,593 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d32425ea/82ca0e14a08045299c6ab9a837cd9d60/FLAG50256c98d [2018-10-23 18:53:26,618 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d32425ea/82ca0e14a08045299c6ab9a837cd9d60 [2018-10-23 18:53:26,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:53:26,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:53:26,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:26,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:53:26,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:53:26,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:26" (1/1) ... [2018-10-23 18:53:26,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5484c6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:26, skipping insertion in model container [2018-10-23 18:53:26,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:26" (1/1) ... [2018-10-23 18:53:26,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:53:26,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:53:27,553 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:27,558 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:53:27,796 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:27,820 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:53:27,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27 WrapperNode [2018-10-23 18:53:27,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:27,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:27,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:53:27,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:53:27,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:27,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:28,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:53:28,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:53:28,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:53:28,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (1/1) ... [2018-10-23 18:53:28,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:53:28,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:53:28,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:53:28,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:53:28,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (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-23 18:53:28,354 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:53:28,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:53:28,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:53:33,492 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:53:33,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:33 BoogieIcfgContainer [2018-10-23 18:53:33,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:53:33,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:53:33,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:53:33,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:53:33,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:26" (1/3) ... [2018-10-23 18:53:33,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626299a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:33, skipping insertion in model container [2018-10-23 18:53:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:27" (2/3) ... [2018-10-23 18:53:33,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626299a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:33, skipping insertion in model container [2018-10-23 18:53:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:33" (3/3) ... [2018-10-23 18:53:33,501 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label23_true-unreach-call.c [2018-10-23 18:53:33,512 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:53:33,522 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:53:33,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:53:33,577 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:53:33,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:53:33,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:53:33,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:53:33,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:53:33,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:53:33,579 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:53:33,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:53:33,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:53:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:53:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 18:53:33,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:33,645 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] [2018-10-23 18:53:33,647 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:33,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877156, now seen corresponding path program 1 times [2018-10-23 18:53:33,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:33,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:33,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:33,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:33,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:34,524 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:53:34,623 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-23 18:53:34,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:34,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:34,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:34,651 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:53:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:38,392 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-23 18:53:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:38,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-10-23 18:53:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:38,419 INFO L225 Difference]: With dead ends: 1079 [2018-10-23 18:53:38,419 INFO L226 Difference]: Without dead ends: 769 [2018-10-23 18:53:38,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-23 18:53:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-23 18:53:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-23 18:53:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-23 18:53:38,524 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 172 [2018-10-23 18:53:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:38,525 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-23 18:53:38,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-23 18:53:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-23 18:53:38,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:38,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:38,536 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:38,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash -413316829, now seen corresponding path program 1 times [2018-10-23 18:53:38,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:38,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:38,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:38,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:38,695 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-23 18:53:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:41,012 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-23 18:53:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:41,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-10-23 18:53:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:41,019 INFO L225 Difference]: With dead ends: 1449 [2018-10-23 18:53:41,019 INFO L226 Difference]: Without dead ends: 938 [2018-10-23 18:53:41,022 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-23 18:53:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-23 18:53:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-23 18:53:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-23 18:53:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-23 18:53:41,093 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 181 [2018-10-23 18:53:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:41,094 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-23 18:53:41,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-23 18:53:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-23 18:53:41,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:41,102 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:53:41,102 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:41,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1137369717, now seen corresponding path program 1 times [2018-10-23 18:53:41,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:41,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:41,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:41,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:41,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:41,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:41,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:41,279 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-10-23 18:53:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:45,317 INFO L93 Difference]: Finished difference Result 3530 states and 5871 transitions. [2018-10-23 18:53:45,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:45,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-23 18:53:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:45,332 INFO L225 Difference]: With dead ends: 3530 [2018-10-23 18:53:45,332 INFO L226 Difference]: Without dead ends: 2609 [2018-10-23 18:53:45,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-10-23 18:53:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1750. [2018-10-23 18:53:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-23 18:53:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-23 18:53:45,381 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 182 [2018-10-23 18:53:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:45,381 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-23 18:53:45,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-23 18:53:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-23 18:53:45,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:45,387 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:53:45,387 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:45,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1234356994, now seen corresponding path program 1 times [2018-10-23 18:53:45,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:45,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:45,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:45,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:45,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:45,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:45,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:45,492 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-23 18:53:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:47,050 INFO L93 Difference]: Finished difference Result 4327 states and 6643 transitions. [2018-10-23 18:53:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:47,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-23 18:53:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:47,066 INFO L225 Difference]: With dead ends: 4327 [2018-10-23 18:53:47,067 INFO L226 Difference]: Without dead ends: 2579 [2018-10-23 18:53:47,071 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-23 18:53:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-10-23 18:53:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2578. [2018-10-23 18:53:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2018-10-23 18:53:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3889 transitions. [2018-10-23 18:53:47,145 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3889 transitions. Word has length 183 [2018-10-23 18:53:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:47,145 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 3889 transitions. [2018-10-23 18:53:47,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3889 transitions. [2018-10-23 18:53:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 18:53:47,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:47,153 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:47,153 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:47,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2013561591, now seen corresponding path program 1 times [2018-10-23 18:53:47,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:47,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:47,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:47,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:47,550 INFO L87 Difference]: Start difference. First operand 2578 states and 3889 transitions. Second operand 3 states. [2018-10-23 18:53:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:49,709 INFO L93 Difference]: Finished difference Result 7609 states and 11523 transitions. [2018-10-23 18:53:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:49,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-23 18:53:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:49,735 INFO L225 Difference]: With dead ends: 7609 [2018-10-23 18:53:49,735 INFO L226 Difference]: Without dead ends: 5033 [2018-10-23 18:53:49,740 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-23 18:53:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-10-23 18:53:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5032. [2018-10-23 18:53:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2018-10-23 18:53:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7054 transitions. [2018-10-23 18:53:49,837 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7054 transitions. Word has length 189 [2018-10-23 18:53:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:49,837 INFO L481 AbstractCegarLoop]: Abstraction has 5032 states and 7054 transitions. [2018-10-23 18:53:49,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7054 transitions. [2018-10-23 18:53:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-23 18:53:49,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:49,849 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:49,849 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:49,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1171437102, now seen corresponding path program 1 times [2018-10-23 18:53:49,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:49,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:49,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:49,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:50,325 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-23 18:53:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:50,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:50,533 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-23 18:53:50,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:50,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:50,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:50,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:53:50,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 18:53:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 18:53:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:53:50,985 INFO L87 Difference]: Start difference. First operand 5032 states and 7054 transitions. Second operand 8 states. [2018-10-23 18:53:51,305 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-23 18:53:52,185 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:54:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:00,139 INFO L93 Difference]: Finished difference Result 23767 states and 33478 transitions. [2018-10-23 18:54:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 18:54:00,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2018-10-23 18:54:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:00,210 INFO L225 Difference]: With dead ends: 23767 [2018-10-23 18:54:00,210 INFO L226 Difference]: Without dead ends: 18737 [2018-10-23 18:54:00,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-23 18:54:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2018-10-23 18:54:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 18319. [2018-10-23 18:54:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2018-10-23 18:54:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 22199 transitions. [2018-10-23 18:54:00,587 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 22199 transitions. Word has length 191 [2018-10-23 18:54:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:00,587 INFO L481 AbstractCegarLoop]: Abstraction has 18319 states and 22199 transitions. [2018-10-23 18:54:00,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 18:54:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 22199 transitions. [2018-10-23 18:54:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-23 18:54:00,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:00,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:00,613 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:00,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:00,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1288004966, now seen corresponding path program 1 times [2018-10-23 18:54:00,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:00,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:00,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:00,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:00,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:00,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:00,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:00,914 INFO L87 Difference]: Start difference. First operand 18319 states and 22199 transitions. Second operand 4 states. [2018-10-23 18:54:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:03,982 INFO L93 Difference]: Finished difference Result 69914 states and 84761 transitions. [2018-10-23 18:54:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:03,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2018-10-23 18:54:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:04,091 INFO L225 Difference]: With dead ends: 69914 [2018-10-23 18:54:04,092 INFO L226 Difference]: Without dead ends: 51597 [2018-10-23 18:54:04,110 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-23 18:54:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51597 states. [2018-10-23 18:54:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51597 to 51593. [2018-10-23 18:54:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51593 states. [2018-10-23 18:54:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51593 states to 51593 states and 61917 transitions. [2018-10-23 18:54:05,006 INFO L78 Accepts]: Start accepts. Automaton has 51593 states and 61917 transitions. Word has length 202 [2018-10-23 18:54:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:05,006 INFO L481 AbstractCegarLoop]: Abstraction has 51593 states and 61917 transitions. [2018-10-23 18:54:05,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 51593 states and 61917 transitions. [2018-10-23 18:54:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-23 18:54:05,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:05,031 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:54:05,031 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:05,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1291616846, now seen corresponding path program 1 times [2018-10-23 18:54:05,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:05,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:05,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:05,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:05,194 INFO L87 Difference]: Start difference. First operand 51593 states and 61917 transitions. Second operand 3 states. [2018-10-23 18:54:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:07,033 INFO L93 Difference]: Finished difference Result 100125 states and 120354 transitions. [2018-10-23 18:54:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:07,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-23 18:54:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:07,106 INFO L225 Difference]: With dead ends: 100125 [2018-10-23 18:54:07,107 INFO L226 Difference]: Without dead ends: 48534 [2018-10-23 18:54:07,156 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-23 18:54:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48534 states. [2018-10-23 18:54:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48534 to 45669. [2018-10-23 18:54:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45669 states. [2018-10-23 18:54:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45669 states to 45669 states and 52629 transitions. [2018-10-23 18:54:07,825 INFO L78 Accepts]: Start accepts. Automaton has 45669 states and 52629 transitions. Word has length 220 [2018-10-23 18:54:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:07,825 INFO L481 AbstractCegarLoop]: Abstraction has 45669 states and 52629 transitions. [2018-10-23 18:54:07,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45669 states and 52629 transitions. [2018-10-23 18:54:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-23 18:54:07,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:07,849 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:54:07,849 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:07,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1278323586, now seen corresponding path program 1 times [2018-10-23 18:54:07,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:07,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:07,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:07,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:07,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-23 18:54:08,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:08,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:54:08,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:54:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:54:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:08,461 INFO L87 Difference]: Start difference. First operand 45669 states and 52629 transitions. Second operand 5 states. [2018-10-23 18:54:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:11,061 INFO L93 Difference]: Finished difference Result 128651 states and 148966 transitions. [2018-10-23 18:54:11,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:54:11,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-10-23 18:54:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:11,168 INFO L225 Difference]: With dead ends: 128651 [2018-10-23 18:54:11,168 INFO L226 Difference]: Without dead ends: 82984 [2018-10-23 18:54:11,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82984 states. [2018-10-23 18:54:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82984 to 77555. [2018-10-23 18:54:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77555 states. [2018-10-23 18:54:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77555 states to 77555 states and 89310 transitions. [2018-10-23 18:54:12,080 INFO L78 Accepts]: Start accepts. Automaton has 77555 states and 89310 transitions. Word has length 223 [2018-10-23 18:54:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:12,080 INFO L481 AbstractCegarLoop]: Abstraction has 77555 states and 89310 transitions. [2018-10-23 18:54:12,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:54:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 77555 states and 89310 transitions. [2018-10-23 18:54:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-23 18:54:12,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:12,106 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:12,106 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:12,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1252765123, now seen corresponding path program 1 times [2018-10-23 18:54:12,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:12,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:12,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-23 18:54:12,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:12,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:12,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:12,670 INFO L87 Difference]: Start difference. First operand 77555 states and 89310 transitions. Second operand 4 states. [2018-10-23 18:54:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:15,066 INFO L93 Difference]: Finished difference Result 238671 states and 274476 transitions. [2018-10-23 18:54:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:15,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-10-23 18:54:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:15,264 INFO L225 Difference]: With dead ends: 238671 [2018-10-23 18:54:15,265 INFO L226 Difference]: Without dead ends: 161118 [2018-10-23 18:54:15,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161118 states. [2018-10-23 18:54:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161118 to 161108. [2018-10-23 18:54:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161108 states. [2018-10-23 18:54:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161108 states to 161108 states and 182897 transitions. [2018-10-23 18:54:18,049 INFO L78 Accepts]: Start accepts. Automaton has 161108 states and 182897 transitions. Word has length 258 [2018-10-23 18:54:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:18,049 INFO L481 AbstractCegarLoop]: Abstraction has 161108 states and 182897 transitions. [2018-10-23 18:54:18,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 161108 states and 182897 transitions. [2018-10-23 18:54:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-23 18:54:18,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:18,075 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:54:18,075 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:18,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -702254135, now seen corresponding path program 1 times [2018-10-23 18:54:18,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:18,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:18,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:18,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:18,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-23 18:54:18,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:18,331 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-23 18:54:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:18,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-23 18:54:18,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:18,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:54:18,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:54:18,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:54:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:54:18,559 INFO L87 Difference]: Start difference. First operand 161108 states and 182897 transitions. Second operand 7 states. [2018-10-23 18:54:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:26,778 INFO L93 Difference]: Finished difference Result 567106 states and 642380 transitions. [2018-10-23 18:54:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 18:54:26,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 281 [2018-10-23 18:54:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:27,358 INFO L225 Difference]: With dead ends: 567106 [2018-10-23 18:54:27,359 INFO L226 Difference]: Without dead ends: 405997 [2018-10-23 18:54:27,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:54:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405997 states. [2018-10-23 18:54:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405997 to 386518. [2018-10-23 18:54:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386518 states. [2018-10-23 18:54:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386518 states to 386518 states and 432524 transitions. [2018-10-23 18:54:32,576 INFO L78 Accepts]: Start accepts. Automaton has 386518 states and 432524 transitions. Word has length 281 [2018-10-23 18:54:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:32,576 INFO L481 AbstractCegarLoop]: Abstraction has 386518 states and 432524 transitions. [2018-10-23 18:54:32,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:54:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 386518 states and 432524 transitions. [2018-10-23 18:54:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-23 18:54:32,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:32,588 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:32,588 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:32,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:32,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1506012389, now seen corresponding path program 1 times [2018-10-23 18:54:32,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:32,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:32,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:32,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-23 18:54:32,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:32,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:32,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:32,990 INFO L87 Difference]: Start difference. First operand 386518 states and 432524 transitions. Second operand 4 states. [2018-10-23 18:54:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:45,822 INFO L93 Difference]: Finished difference Result 1116454 states and 1241555 transitions. [2018-10-23 18:54:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:45,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 293 [2018-10-23 18:54:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:46,804 INFO L225 Difference]: With dead ends: 1116454 [2018-10-23 18:54:46,804 INFO L226 Difference]: Without dead ends: 729938 [2018-10-23 18:54:47,058 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-23 18:54:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729938 states. [2018-10-23 18:54:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729938 to 573081. [2018-10-23 18:54:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573081 states. [2018-10-23 18:54:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573081 states to 573081 states and 632488 transitions. [2018-10-23 18:54:57,048 INFO L78 Accepts]: Start accepts. Automaton has 573081 states and 632488 transitions. Word has length 293 [2018-10-23 18:54:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:57,048 INFO L481 AbstractCegarLoop]: Abstraction has 573081 states and 632488 transitions. [2018-10-23 18:54:57,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 573081 states and 632488 transitions. [2018-10-23 18:54:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-23 18:54:57,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:57,061 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:57,062 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:57,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash -96945716, now seen corresponding path program 1 times [2018-10-23 18:54:57,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:57,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-23 18:54:57,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:54:57,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:57,305 INFO L87 Difference]: Start difference. First operand 573081 states and 632488 transitions. Second operand 3 states. [2018-10-23 18:55:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:11,668 INFO L93 Difference]: Finished difference Result 1146130 states and 1264944 transitions. [2018-10-23 18:55:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:11,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-10-23 18:55:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:12,400 INFO L225 Difference]: With dead ends: 1146130 [2018-10-23 18:55:12,400 INFO L226 Difference]: Without dead ends: 573051 [2018-10-23 18:55:12,637 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-23 18:55:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573051 states. [2018-10-23 18:55:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573051 to 573051. [2018-10-23 18:55:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573051 states. [2018-10-23 18:55:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573051 states to 573051 states and 632408 transitions. [2018-10-23 18:55:21,227 INFO L78 Accepts]: Start accepts. Automaton has 573051 states and 632408 transitions. Word has length 314 [2018-10-23 18:55:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:21,227 INFO L481 AbstractCegarLoop]: Abstraction has 573051 states and 632408 transitions. [2018-10-23 18:55:21,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 573051 states and 632408 transitions. [2018-10-23 18:55:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-23 18:55:21,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:21,240 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-10-23 18:55:21,241 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:21,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 970070550, now seen corresponding path program 1 times [2018-10-23 18:55:21,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:55:21,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:21,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:21,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:21,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:21,722 INFO L87 Difference]: Start difference. First operand 573051 states and 632408 transitions. Second operand 4 states. [2018-10-23 18:55:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:28,859 INFO L93 Difference]: Finished difference Result 1107749 states and 1220063 transitions. [2018-10-23 18:55:28,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:28,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-23 18:55:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:29,605 INFO L225 Difference]: With dead ends: 1107749 [2018-10-23 18:55:29,605 INFO L226 Difference]: Without dead ends: 534700 [2018-10-23 18:55:29,874 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-23 18:55:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534700 states. [2018-10-23 18:55:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534700 to 427835. [2018-10-23 18:55:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427835 states. [2018-10-23 18:55:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427835 states to 427835 states and 467700 transitions. [2018-10-23 18:55:37,800 INFO L78 Accepts]: Start accepts. Automaton has 427835 states and 467700 transitions. Word has length 315 [2018-10-23 18:55:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:37,800 INFO L481 AbstractCegarLoop]: Abstraction has 427835 states and 467700 transitions. [2018-10-23 18:55:37,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 427835 states and 467700 transitions. [2018-10-23 18:55:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-23 18:55:37,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:37,817 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:55:37,817 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:37,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash 615754466, now seen corresponding path program 1 times [2018-10-23 18:55:37,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:37,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-23 18:55:38,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:38,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:38,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:38,091 INFO L87 Difference]: Start difference. First operand 427835 states and 467700 transitions. Second operand 4 states. [2018-10-23 18:55:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:47,389 INFO L93 Difference]: Finished difference Result 866138 states and 947465 transitions. [2018-10-23 18:55:47,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:47,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-10-23 18:55:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:47,992 INFO L225 Difference]: With dead ends: 866138 [2018-10-23 18:55:47,993 INFO L226 Difference]: Without dead ends: 438305 [2018-10-23 18:55:48,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438305 states. [2018-10-23 18:55:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438305 to 437225. [2018-10-23 18:55:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437225 states. [2018-10-23 18:55:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437225 states to 437225 states and 474630 transitions. [2018-10-23 18:55:54,124 INFO L78 Accepts]: Start accepts. Automaton has 437225 states and 474630 transitions. Word has length 330 [2018-10-23 18:55:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:54,125 INFO L481 AbstractCegarLoop]: Abstraction has 437225 states and 474630 transitions. [2018-10-23 18:55:54,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 437225 states and 474630 transitions. [2018-10-23 18:55:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-23 18:55:54,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:54,141 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:55:54,141 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:54,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -849692513, now seen corresponding path program 1 times [2018-10-23 18:55:54,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:54,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:54,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 176 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:56,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:55:56,048 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-23 18:55:56,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:56,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:55:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:55:56,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:55:56,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:55:56,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:55:56,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:55:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:55:56,336 INFO L87 Difference]: Start difference. First operand 437225 states and 474630 transitions. Second operand 7 states. [2018-10-23 18:56:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:05,325 INFO L93 Difference]: Finished difference Result 897778 states and 974894 transitions. [2018-10-23 18:56:05,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-23 18:56:05,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 332 [2018-10-23 18:56:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:05,886 INFO L225 Difference]: With dead ends: 897778 [2018-10-23 18:56:05,886 INFO L226 Difference]: Without dead ends: 460555 [2018-10-23 18:56:06,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-10-23 18:56:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460555 states. [2018-10-23 18:56:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460555 to 446001. [2018-10-23 18:56:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446001 states. [2018-10-23 18:56:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446001 states to 446001 states and 481273 transitions. [2018-10-23 18:56:12,668 INFO L78 Accepts]: Start accepts. Automaton has 446001 states and 481273 transitions. Word has length 332 [2018-10-23 18:56:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:12,669 INFO L481 AbstractCegarLoop]: Abstraction has 446001 states and 481273 transitions. [2018-10-23 18:56:12,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:56:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 446001 states and 481273 transitions. [2018-10-23 18:56:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-23 18:56:12,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:12,680 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:12,680 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:12,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1613952301, now seen corresponding path program 1 times [2018-10-23 18:56:12,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:12,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:12,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:56:14,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:14,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:14,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:14,205 INFO L87 Difference]: Start difference. First operand 446001 states and 481273 transitions. Second operand 3 states. [2018-10-23 18:56:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:25,362 INFO L93 Difference]: Finished difference Result 1267610 states and 1367052 transitions. [2018-10-23 18:56:25,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:25,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-23 18:56:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:26,472 INFO L225 Difference]: With dead ends: 1267610 [2018-10-23 18:56:26,473 INFO L226 Difference]: Without dead ends: 821611 [2018-10-23 18:56:26,677 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-23 18:56:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821611 states. [2018-10-23 18:56:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821611 to 821609. [2018-10-23 18:56:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821609 states. [2018-10-23 18:56:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821609 states to 821609 states and 883241 transitions. [2018-10-23 18:56:40,585 INFO L78 Accepts]: Start accepts. Automaton has 821609 states and 883241 transitions. Word has length 337 [2018-10-23 18:56:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:40,585 INFO L481 AbstractCegarLoop]: Abstraction has 821609 states and 883241 transitions. [2018-10-23 18:56:40,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 821609 states and 883241 transitions. [2018-10-23 18:56:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-23 18:56:40,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:40,613 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:56:40,614 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:40,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1263247419, now seen corresponding path program 1 times [2018-10-23 18:56:40,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:40,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:40,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-23 18:56:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 18:56:41,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:56:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:56:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:41,099 INFO L87 Difference]: Start difference. First operand 821609 states and 883241 transitions. Second operand 5 states. Received shutdown request... [2018-10-23 18:56:51,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:56:51,984 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:56:51,989 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:56:51,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:56:51 BoogieIcfgContainer [2018-10-23 18:56:51,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:56:51,991 INFO L168 Benchmark]: Toolchain (without parser) took 205358.76 ms. Allocated memory was 1.5 GB in the beginning and 5.9 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -959.5 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:51,992 INFO L168 Benchmark]: CDTParser took 0.23 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-23 18:56:51,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1186.46 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-23 18:56:51,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 301.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:51,994 INFO L168 Benchmark]: Boogie Preprocessor took 154.66 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-23 18:56:51,995 INFO L168 Benchmark]: RCFGBuilder took 5213.68 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: 249.2 MB). Peak memory consumption was 249.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:51,996 INFO L168 Benchmark]: TraceAbstraction took 198496.41 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -436.5 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:52,002 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.23 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 1186.46 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 301.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.66 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 5213.68 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: 249.2 MB). Peak memory consumption was 249.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198496.41 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -436.5 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1548]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1548). Cancelled while BasicCegarLoop was constructing difference of abstraction (821609states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (1386722 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 198.4s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 123.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4972 SDtfs, 21575 SDslu, 3685 SDs, 0 SdLazy, 23532 SolverSat, 6213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 825 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821609occurred in iteration=17, 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: 63.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 308695 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5412 NumberOfCodeBlocks, 5412 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791714 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1460 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 2597/2613 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown