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_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:58:42,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:58:42,852 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:58:42,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:58:42,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:58:42,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:58:42,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:58:42,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:58:42,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:58:42,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:58:42,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:58:42,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:58:42,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:58:42,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:58:42,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:58:42,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:58:42,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:58:42,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:58:42,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:58:42,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:58:42,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:58:42,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:58:42,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:58:42,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:58:42,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:58:42,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:58:42,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:58:42,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:58:42,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:58:42,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:58:42,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:58:42,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:58:42,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:58:42,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:58:42,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:58:42,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:58:42,926 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:58:42,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:58:42,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:58:42,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:58:42,946 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:58:42,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:58:42,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:58:42,947 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:58:42,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:58:42,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:58:42,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:58:42,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:58:42,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:58:42,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:58:42,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:58:42,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:58:42,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:58:42,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:58:42,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:58:42,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:58:42,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:58:42,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:58:42,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:58:42,951 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:58:43,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:58:43,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:58:43,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:58:43,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:58:43,030 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:58:43,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label34_true-unreach-call.c [2018-10-24 14:58:43,088 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e4971ea6/2ec7bb92002f47419679c8a780c8ac00/FLAG34b534965 [2018-10-24 14:58:43,721 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:58:43,726 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label34_true-unreach-call.c [2018-10-24 14:58:43,747 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e4971ea6/2ec7bb92002f47419679c8a780c8ac00/FLAG34b534965 [2018-10-24 14:58:43,766 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e4971ea6/2ec7bb92002f47419679c8a780c8ac00 [2018-10-24 14:58:43,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:58:43,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:58:43,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:58:43,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:58:43,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:58:43,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:58:43" (1/1) ... [2018-10-24 14:58:43,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:43, skipping insertion in model container [2018-10-24 14:58:43,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:58:43" (1/1) ... [2018-10-24 14:58:43,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:58:43,890 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:58:44,613 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:58:44,619 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:58:44,870 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:58:44,893 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:58:44,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44 WrapperNode [2018-10-24 14:58:44,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:58:44,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:58:44,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:58:44,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:58:44,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:44,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:58:45,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:58:45,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:58:45,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:58:45,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... [2018-10-24 14:58:45,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:58:45,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:58:45,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:58:45,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:58:45,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:58:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:58:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:58:45,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:58:50,476 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:58:50,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:58:50 BoogieIcfgContainer [2018-10-24 14:58:50,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:58:50,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:58:50,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:58:50,485 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:58:50,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:58:43" (1/3) ... [2018-10-24 14:58:50,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:58:50, skipping insertion in model container [2018-10-24 14:58:50,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:58:44" (2/3) ... [2018-10-24 14:58:50,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:58:50, skipping insertion in model container [2018-10-24 14:58:50,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:58:50" (3/3) ... [2018-10-24 14:58:50,490 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label34_true-unreach-call.c [2018-10-24 14:58:50,501 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:58:50,510 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:58:50,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:58:50,567 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:58:50,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:58:50,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:58:50,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:58:50,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:58:50,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:58:50,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:58:50,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:58:50,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:58:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:58:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-24 14:58:50,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:50,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:50,620 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:50,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1912700218, now seen corresponding path program 1 times [2018-10-24 14:58:50,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:50,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:50,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:50,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:50,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:51,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:51,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:51,512 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-24 14:58:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:54,042 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-24 14:58:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:54,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-24 14:58:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:54,067 INFO L225 Difference]: With dead ends: 832 [2018-10-24 14:58:54,067 INFO L226 Difference]: Without dead ends: 525 [2018-10-24 14:58:54,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-24 14:58:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-24 14:58:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-24 14:58:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-24 14:58:54,169 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 191 [2018-10-24 14:58:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:54,170 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-24 14:58:54,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-24 14:58:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:58:54,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:54,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:54,178 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:54,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1131928361, now seen corresponding path program 1 times [2018-10-24 14:58:54,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:54,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:54,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:54,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:54,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:54,445 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-24 14:58:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:58,955 INFO L93 Difference]: Finished difference Result 1892 states and 3348 transitions. [2018-10-24 14:58:58,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:58,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-24 14:58:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:58,966 INFO L225 Difference]: With dead ends: 1892 [2018-10-24 14:58:58,967 INFO L226 Difference]: Without dead ends: 1383 [2018-10-24 14:58:58,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-24 14:58:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 923. [2018-10-24 14:58:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:58:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:58:59,012 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 197 [2018-10-24 14:58:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:59,013 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:58:59,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:58:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-24 14:58:59,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:59,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:59,020 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -292852035, now seen corresponding path program 1 times [2018-10-24 14:58:59,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:59,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:59,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:59,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:59,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:59,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:59,143 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:59:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:00,234 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 14:59:00,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-24 14:59:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:00,241 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 14:59:00,241 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 14:59:00,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 14:59:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 14:59:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 14:59:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 14:59:00,264 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 205 [2018-10-24 14:59:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:00,264 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 14:59:00,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 14:59:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-24 14:59:00,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:00,269 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:00,269 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:00,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1441741858, now seen corresponding path program 1 times [2018-10-24 14:59:00,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:00,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:00,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:59:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:00,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:00,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:00,540 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 14:59:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:02,818 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-24 14:59:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:02,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-10-24 14:59:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:02,832 INFO L225 Difference]: With dead ends: 3476 [2018-10-24 14:59:02,832 INFO L226 Difference]: Without dead ends: 2576 [2018-10-24 14:59:02,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-24 14:59:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-24 14:59:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 14:59:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 14:59:02,890 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 207 [2018-10-24 14:59:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:02,891 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 14:59:02,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 14:59:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-24 14:59:02,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:02,899 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:02,899 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1233483722, now seen corresponding path program 1 times [2018-10-24 14:59:02,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:02,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:59:03,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:03,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:03,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:03,083 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 14:59:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:03,606 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-24 14:59:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:03,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-24 14:59:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:03,623 INFO L225 Difference]: With dead ends: 5159 [2018-10-24 14:59:03,623 INFO L226 Difference]: Without dead ends: 3438 [2018-10-24 14:59:03,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-24 14:59:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-24 14:59:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-24 14:59:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-24 14:59:03,699 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 214 [2018-10-24 14:59:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:03,700 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-24 14:59:03,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-24 14:59:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-24 14:59:03,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:03,708 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:03,709 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:03,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 37302206, now seen corresponding path program 1 times [2018-10-24 14:59:03,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:03,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:03,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:04,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:04,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:59:04,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:59:04,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:59:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:04,144 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-24 14:59:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:07,112 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-24 14:59:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:59:07,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2018-10-24 14:59:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:07,132 INFO L225 Difference]: With dead ends: 7939 [2018-10-24 14:59:07,132 INFO L226 Difference]: Without dead ends: 4505 [2018-10-24 14:59:07,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-24 14:59:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-24 14:59:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-24 14:59:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-24 14:59:07,204 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 231 [2018-10-24 14:59:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:07,204 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-24 14:59:07,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:59:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-24 14:59:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 14:59:07,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:07,213 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:07,213 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:07,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2040757814, now seen corresponding path program 1 times [2018-10-24 14:59:07,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:07,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:07,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:07,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:07,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:07,388 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-24 14:59:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:08,607 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-24 14:59:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:08,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-24 14:59:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:08,625 INFO L225 Difference]: With dead ends: 8933 [2018-10-24 14:59:08,625 INFO L226 Difference]: Without dead ends: 5295 [2018-10-24 14:59:08,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-24 14:59:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-24 14:59:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-24 14:59:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-24 14:59:08,720 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 233 [2018-10-24 14:59:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:08,721 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-24 14:59:08,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-24 14:59:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-24 14:59:08,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:08,732 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:08,732 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:08,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -408667746, now seen corresponding path program 1 times [2018-10-24 14:59:08,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:09,304 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 14:59:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:09,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:09,437 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:59:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:09,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:09,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:59:09,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:59:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:59:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:59:09,813 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 8 states. [2018-10-24 14:59:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:17,132 INFO L93 Difference]: Finished difference Result 23470 states and 34139 transitions. [2018-10-24 14:59:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 14:59:17,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2018-10-24 14:59:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:17,190 INFO L225 Difference]: With dead ends: 23470 [2018-10-24 14:59:17,190 INFO L226 Difference]: Without dead ends: 18179 [2018-10-24 14:59:17,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:59:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18179 states. [2018-10-24 14:59:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18179 to 17765. [2018-10-24 14:59:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17765 states. [2018-10-24 14:59:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 22455 transitions. [2018-10-24 14:59:17,512 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 22455 transitions. Word has length 241 [2018-10-24 14:59:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:17,512 INFO L481 AbstractCegarLoop]: Abstraction has 17765 states and 22455 transitions. [2018-10-24 14:59:17,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:59:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 22455 transitions. [2018-10-24 14:59:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-24 14:59:17,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:17,541 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:17,541 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -533869373, now seen corresponding path program 1 times [2018-10-24 14:59:17,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 14:59:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:17,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:17,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:17,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:17,704 INFO L87 Difference]: Start difference. First operand 17765 states and 22455 transitions. Second operand 3 states. [2018-10-24 14:59:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:19,496 INFO L93 Difference]: Finished difference Result 47563 states and 59766 transitions. [2018-10-24 14:59:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:19,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-10-24 14:59:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:19,557 INFO L225 Difference]: With dead ends: 47563 [2018-10-24 14:59:19,557 INFO L226 Difference]: Without dead ends: 29800 [2018-10-24 14:59:19,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29800 states. [2018-10-24 14:59:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29800 to 29798. [2018-10-24 14:59:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29798 states. [2018-10-24 14:59:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29798 states to 29798 states and 35718 transitions. [2018-10-24 14:59:19,996 INFO L78 Accepts]: Start accepts. Automaton has 29798 states and 35718 transitions. Word has length 287 [2018-10-24 14:59:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:19,997 INFO L481 AbstractCegarLoop]: Abstraction has 29798 states and 35718 transitions. [2018-10-24 14:59:19,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29798 states and 35718 transitions. [2018-10-24 14:59:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-24 14:59:20,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:20,038 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:20,038 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:20,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1021598578, now seen corresponding path program 1 times [2018-10-24 14:59:20,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:20,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:20,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:20,352 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:59:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 14:59:20,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:20,437 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:59:20,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:20,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-24 14:59:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:20,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:59:20,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:59:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:59:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:20,822 INFO L87 Difference]: Start difference. First operand 29798 states and 35718 transitions. Second operand 5 states. [2018-10-24 14:59:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:23,374 INFO L93 Difference]: Finished difference Result 64902 states and 77632 transitions. [2018-10-24 14:59:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:23,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-10-24 14:59:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:23,424 INFO L225 Difference]: With dead ends: 64902 [2018-10-24 14:59:23,424 INFO L226 Difference]: Without dead ends: 35106 [2018-10-24 14:59:23,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35106 states. [2018-10-24 14:59:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35106 to 33470. [2018-10-24 14:59:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33470 states. [2018-10-24 14:59:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33470 states to 33470 states and 38880 transitions. [2018-10-24 14:59:23,883 INFO L78 Accepts]: Start accepts. Automaton has 33470 states and 38880 transitions. Word has length 300 [2018-10-24 14:59:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:23,884 INFO L481 AbstractCegarLoop]: Abstraction has 33470 states and 38880 transitions. [2018-10-24 14:59:23,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:59:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33470 states and 38880 transitions. [2018-10-24 14:59:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-24 14:59:23,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:23,936 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:23,936 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:23,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2132467535, now seen corresponding path program 1 times [2018-10-24 14:59:23,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:23,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 14:59:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:24,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:24,275 INFO L87 Difference]: Start difference. First operand 33470 states and 38880 transitions. Second operand 4 states. [2018-10-24 14:59:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:26,285 INFO L93 Difference]: Finished difference Result 103829 states and 120196 transitions. [2018-10-24 14:59:26,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:26,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-24 14:59:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:26,386 INFO L225 Difference]: With dead ends: 103829 [2018-10-24 14:59:26,386 INFO L226 Difference]: Without dead ends: 70361 [2018-10-24 14:59:26,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-10-24 14:59:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 70357. [2018-10-24 14:59:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70357 states. [2018-10-24 14:59:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70357 states to 70357 states and 80068 transitions. [2018-10-24 14:59:27,576 INFO L78 Accepts]: Start accepts. Automaton has 70357 states and 80068 transitions. Word has length 308 [2018-10-24 14:59:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:27,577 INFO L481 AbstractCegarLoop]: Abstraction has 70357 states and 80068 transitions. [2018-10-24 14:59:27,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 70357 states and 80068 transitions. [2018-10-24 14:59:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-24 14:59:27,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:27,605 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:27,606 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:27,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1792595925, now seen corresponding path program 1 times [2018-10-24 14:59:27,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:27,945 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:59:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:59:28,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:28,016 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:59:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:28,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:59:28,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:28,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:59:28,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:59:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:59:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:59:28,309 INFO L87 Difference]: Start difference. First operand 70357 states and 80068 transitions. Second operand 7 states. [2018-10-24 14:59:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:34,900 INFO L93 Difference]: Finished difference Result 246247 states and 279293 transitions. [2018-10-24 14:59:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:59:34,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2018-10-24 14:59:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:35,154 INFO L225 Difference]: With dead ends: 246247 [2018-10-24 14:59:35,154 INFO L226 Difference]: Without dead ends: 175891 [2018-10-24 14:59:35,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:59:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175891 states. [2018-10-24 14:59:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175891 to 166469. [2018-10-24 14:59:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166469 states. [2018-10-24 14:59:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166469 states to 166469 states and 186010 transitions. [2018-10-24 14:59:38,079 INFO L78 Accepts]: Start accepts. Automaton has 166469 states and 186010 transitions. Word has length 331 [2018-10-24 14:59:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:38,079 INFO L481 AbstractCegarLoop]: Abstraction has 166469 states and 186010 transitions. [2018-10-24 14:59:38,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:59:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 166469 states and 186010 transitions. [2018-10-24 14:59:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-24 14:59:38,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:38,111 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:38,111 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:38,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash 827616549, now seen corresponding path program 1 times [2018-10-24 14:59:38,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:38,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:38,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 14:59:38,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:38,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:38,550 INFO L87 Difference]: Start difference. First operand 166469 states and 186010 transitions. Second operand 4 states. [2018-10-24 14:59:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:42,198 INFO L93 Difference]: Finished difference Result 476196 states and 530997 transitions. [2018-10-24 14:59:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:42,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-10-24 14:59:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:42,573 INFO L225 Difference]: With dead ends: 476196 [2018-10-24 14:59:42,573 INFO L226 Difference]: Without dead ends: 309729 [2018-10-24 14:59:42,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309729 states. [2018-10-24 14:59:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309729 to 240274. [2018-10-24 14:59:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240274 states. [2018-10-24 14:59:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240274 states to 240274 states and 265833 transitions. [2018-10-24 14:59:46,576 INFO L78 Accepts]: Start accepts. Automaton has 240274 states and 265833 transitions. Word has length 336 [2018-10-24 14:59:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:46,577 INFO L481 AbstractCegarLoop]: Abstraction has 240274 states and 265833 transitions. [2018-10-24 14:59:46,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 240274 states and 265833 transitions. [2018-10-24 14:59:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-24 14:59:46,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:46,622 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:46,623 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:46,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1229916392, now seen corresponding path program 1 times [2018-10-24 14:59:46,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 14:59:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:46,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:46,876 INFO L87 Difference]: Start difference. First operand 240274 states and 265833 transitions. Second operand 3 states. [2018-10-24 14:59:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:50,443 INFO L93 Difference]: Finished difference Result 480536 states and 531654 transitions. [2018-10-24 14:59:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:50,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2018-10-24 14:59:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:50,772 INFO L225 Difference]: With dead ends: 480536 [2018-10-24 14:59:50,772 INFO L226 Difference]: Without dead ends: 240264 [2018-10-24 14:59:50,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240264 states. [2018-10-24 14:59:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240264 to 240264. [2018-10-24 14:59:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240264 states. [2018-10-24 14:59:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240264 states to 240264 states and 265806 transitions. [2018-10-24 14:59:59,682 INFO L78 Accepts]: Start accepts. Automaton has 240264 states and 265806 transitions. Word has length 364 [2018-10-24 14:59:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:59,682 INFO L481 AbstractCegarLoop]: Abstraction has 240264 states and 265806 transitions. [2018-10-24 14:59:59,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 240264 states and 265806 transitions. [2018-10-24 14:59:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-24 14:59:59,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:59,716 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:59,716 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:59,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1039226532, now seen corresponding path program 1 times [2018-10-24 14:59:59,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:59,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:59,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-24 15:00:00,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:00,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:00,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:00,106 INFO L87 Difference]: Start difference. First operand 240264 states and 265806 transitions. Second operand 4 states. [2018-10-24 15:00:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:04,113 INFO L93 Difference]: Finished difference Result 870276 states and 960747 transitions. [2018-10-24 15:00:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:04,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-24 15:00:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:04,911 INFO L225 Difference]: With dead ends: 870276 [2018-10-24 15:00:04,911 INFO L226 Difference]: Without dead ends: 630014 [2018-10-24 15:00:05,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630014 states. [2018-10-24 15:00:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630014 to 400371. [2018-10-24 15:00:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400371 states. [2018-10-24 15:00:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400371 states to 400371 states and 440874 transitions. [2018-10-24 15:00:13,816 INFO L78 Accepts]: Start accepts. Automaton has 400371 states and 440874 transitions. Word has length 365 [2018-10-24 15:00:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:13,817 INFO L481 AbstractCegarLoop]: Abstraction has 400371 states and 440874 transitions. [2018-10-24 15:00:13,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 400371 states and 440874 transitions. [2018-10-24 15:00:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-24 15:00:13,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:13,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:13,858 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:13,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1352077086, now seen corresponding path program 1 times [2018-10-24 15:00:13,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:13,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:13,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:14,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:14,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:14,278 INFO L87 Difference]: Start difference. First operand 400371 states and 440874 transitions. Second operand 4 states. [2018-10-24 15:00:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:21,426 INFO L93 Difference]: Finished difference Result 804023 states and 885545 transitions. [2018-10-24 15:00:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:21,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-24 15:00:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:22,090 INFO L225 Difference]: With dead ends: 804023 [2018-10-24 15:00:22,091 INFO L226 Difference]: Without dead ends: 403654 [2018-10-24 15:00:22,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403654 states. [2018-10-24 15:00:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403654 to 402812. [2018-10-24 15:00:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402812 states. [2018-10-24 15:00:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402812 states to 402812 states and 440653 transitions. [2018-10-24 15:00:34,323 INFO L78 Accepts]: Start accepts. Automaton has 402812 states and 440653 transitions. Word has length 365 [2018-10-24 15:00:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:34,323 INFO L481 AbstractCegarLoop]: Abstraction has 402812 states and 440653 transitions. [2018-10-24 15:00:34,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 402812 states and 440653 transitions. [2018-10-24 15:00:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-24 15:00:34,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:34,356 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:34,356 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:34,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash 612074820, now seen corresponding path program 1 times [2018-10-24 15:00:34,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:34,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:34,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 15:00:34,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:34,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:34,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:34,713 INFO L87 Difference]: Start difference. First operand 402812 states and 440653 transitions. Second operand 4 states. [2018-10-24 15:00:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:39,686 INFO L93 Difference]: Finished difference Result 805622 states and 881304 transitions. [2018-10-24 15:00:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:39,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-24 15:00:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:40,303 INFO L225 Difference]: With dead ends: 805622 [2018-10-24 15:00:40,303 INFO L226 Difference]: Without dead ends: 402812 [2018-10-24 15:00:40,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402812 states. [2018-10-24 15:00:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402812 to 402812. [2018-10-24 15:00:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402812 states. [2018-10-24 15:00:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402812 states to 402812 states and 440450 transitions. [2018-10-24 15:00:48,117 INFO L78 Accepts]: Start accepts. Automaton has 402812 states and 440450 transitions. Word has length 365 [2018-10-24 15:00:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:48,117 INFO L481 AbstractCegarLoop]: Abstraction has 402812 states and 440450 transitions. [2018-10-24 15:00:48,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 402812 states and 440450 transitions. [2018-10-24 15:00:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-24 15:00:48,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:48,153 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:48,154 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:48,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1143744569, now seen corresponding path program 1 times [2018-10-24 15:00:48,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:48,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 15:00:48,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:48,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:48,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:48,570 INFO L87 Difference]: Start difference. First operand 402812 states and 440450 transitions. Second operand 4 states. [2018-10-24 15:00:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:56,528 INFO L93 Difference]: Finished difference Result 1370537 states and 1494917 transitions. [2018-10-24 15:00:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:56,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2018-10-24 15:00:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:57,955 INFO L225 Difference]: With dead ends: 1370537 [2018-10-24 15:00:57,956 INFO L226 Difference]: Without dead ends: 967727 [2018-10-24 15:00:58,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967727 states. [2018-10-24 15:01:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967727 to 632184. [2018-10-24 15:01:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632184 states. [2018-10-24 15:01:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632184 states to 632184 states and 687004 transitions. [2018-10-24 15:01:18,237 INFO L78 Accepts]: Start accepts. Automaton has 632184 states and 687004 transitions. Word has length 369 [2018-10-24 15:01:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:18,237 INFO L481 AbstractCegarLoop]: Abstraction has 632184 states and 687004 transitions. [2018-10-24 15:01:18,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 632184 states and 687004 transitions. [2018-10-24 15:01:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-24 15:01:19,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:19,761 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:19,761 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1403139758, now seen corresponding path program 1 times [2018-10-24 15:01:19,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:19,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:19,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-24 15:01:20,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:20,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:20,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:20,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:20,064 INFO L87 Difference]: Start difference. First operand 632184 states and 687004 transitions. Second operand 4 states. [2018-10-24 15:01:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:28,798 INFO L93 Difference]: Finished difference Result 1283449 states and 1396506 transitions. [2018-10-24 15:01:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:28,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-24 15:01:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:29,899 INFO L225 Difference]: With dead ends: 1283449 [2018-10-24 15:01:29,899 INFO L226 Difference]: Without dead ends: 629755 [2018-10-24 15:01:30,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629755 states. [2018-10-24 15:01:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629755 to 605700. [2018-10-24 15:01:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605700 states. [2018-10-24 15:01:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605700 states to 605700 states and 653159 transitions. [2018-10-24 15:01:41,280 INFO L78 Accepts]: Start accepts. Automaton has 605700 states and 653159 transitions. Word has length 380 [2018-10-24 15:01:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:41,281 INFO L481 AbstractCegarLoop]: Abstraction has 605700 states and 653159 transitions. [2018-10-24 15:01:41,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 605700 states and 653159 transitions. [2018-10-24 15:01:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-24 15:01:41,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:41,323 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:41,324 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:41,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1388378923, now seen corresponding path program 1 times [2018-10-24 15:01:41,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:41,769 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:01:42,028 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:01:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 193 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:42,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:42,538 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:42,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:42,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:43,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:43,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 15:01:43,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 15:01:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 15:01:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:01:43,064 INFO L87 Difference]: Start difference. First operand 605700 states and 653159 transitions. Second operand 10 states. [2018-10-24 15:01:43,729 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 Received shutdown request... [2018-10-24 15:02:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 15:02:08,327 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:02:08,333 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:02:08,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:02:08 BoogieIcfgContainer [2018-10-24 15:02:08,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:02:08,334 INFO L168 Benchmark]: Toolchain (without parser) took 204555.46 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 4.5 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,336 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:02:08,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1112.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 316.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -898.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,338 INFO L168 Benchmark]: Boogie Preprocessor took 145.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,339 INFO L168 Benchmark]: RCFGBuilder took 5120.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 260.1 MB). Peak memory consumption was 260.1 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,339 INFO L168 Benchmark]: TraceAbstraction took 197853.94 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 15:02:08,344 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1112.98 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 316.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -898.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5120.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 260.1 MB). Peak memory consumption was 260.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197853.94 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1605]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1605). Cancelled while BasicCegarLoop was constructing difference of abstraction (605700states) and FLOYD_HOARE automaton (currently 28 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (1090258 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.7s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 108.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4984 SDtfs, 19696 SDslu, 5692 SDs, 0 SdLazy, 28702 SolverSat, 5296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1373 GetRequests, 1287 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632184occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 77.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 673212 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 7125 NumberOfCodeBlocks, 7125 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7101 ConstructedInterpolants, 0 QuantifiedInterpolants, 5646847 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 4128/4197 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown