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_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:40,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:40,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:40,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:40,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:40,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:40,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:40,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:40,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:40,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:40,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:40,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:40,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:40,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:40,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:40,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:40,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:40,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:40,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:40,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:40,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:40,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:40,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:40,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:40,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:40,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:40,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:40,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:40,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:40,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:40,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:40,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:40,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:40,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:40,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:40,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:40,559 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 15:00:40,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:40,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:40,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:40,589 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:40,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:40,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:40,590 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:40,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:40,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:40,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:40,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:40,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:40,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:40,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:40,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:40,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:40,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:40,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:40,593 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:40,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:40,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:40,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:40,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:40,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:40,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:40,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:40,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:40,596 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:40,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:40,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:40,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:40,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:40,673 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:40,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-24 15:00:40,732 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a4cdd38dd/837137f0df5f41b9b6a1056a5d49b882/FLAG16c031710 [2018-10-24 15:00:41,411 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:41,412 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-24 15:00:41,430 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a4cdd38dd/837137f0df5f41b9b6a1056a5d49b882/FLAG16c031710 [2018-10-24 15:00:41,449 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a4cdd38dd/837137f0df5f41b9b6a1056a5d49b882 [2018-10-24 15:00:41,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:41,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:41,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:41,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:41,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:41,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:41" (1/1) ... [2018-10-24 15:00:41,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d19047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:41, skipping insertion in model container [2018-10-24 15:00:41,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:41" (1/1) ... [2018-10-24 15:00:41,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:41,598 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:42,323 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:42,329 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:42,637 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:42,664 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:42,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42 WrapperNode [2018-10-24 15:00:42,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:42,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:42,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:42,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:42,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:42,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:42,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:42,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:42,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:42,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:43,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (1/1) ... [2018-10-24 15:00:43,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:43,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:43,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:43,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:43,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (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 15:00:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:48,295 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:48,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:48 BoogieIcfgContainer [2018-10-24 15:00:48,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:48,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:48,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:48,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:48,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:41" (1/3) ... [2018-10-24 15:00:48,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51764e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:48, skipping insertion in model container [2018-10-24 15:00:48,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:42" (2/3) ... [2018-10-24 15:00:48,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51764e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:48, skipping insertion in model container [2018-10-24 15:00:48,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:48" (3/3) ... [2018-10-24 15:00:48,304 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-10-24 15:00:48,313 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:48,321 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:48,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:48,377 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:48,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:48,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:48,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:48,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:48,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:48,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:48,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:48,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-24 15:00:48,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:48,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:48,430 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:48,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2009406410, now seen corresponding path program 1 times [2018-10-24 15:00:48,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:48,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:48,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:49,392 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 15:00:49,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:49,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:49,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:49,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:49,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:49,422 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:00:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:52,534 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 15:00:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:52,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-10-24 15:00:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:52,564 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 15:00:52,564 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 15:00:52,570 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:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 15:00:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 15:00:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 15:00:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 15:00:52,665 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 195 [2018-10-24 15:00:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:52,671 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 15:00:52,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 15:00:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 15:00:52,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:52,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:52,687 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:52,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -907220423, now seen corresponding path program 1 times [2018-10-24 15:00:52,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:52,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:53,098 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 15:00:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:53,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:53,101 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 15:00:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:57,912 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-24 15:00:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:57,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-24 15:00:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:57,921 INFO L225 Difference]: With dead ends: 1904 [2018-10-24 15:00:57,921 INFO L226 Difference]: Without dead ends: 1391 [2018-10-24 15:00:57,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-24 15:00:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-24 15:00:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 15:00:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 15:00:57,971 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 201 [2018-10-24 15:00:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:57,971 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 15:00:57,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 15:00:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 15:00:57,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:57,975 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:57,976 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:57,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 330620286, now seen corresponding path program 1 times [2018-10-24 15:00:57,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:57,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:57,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:58,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:58,094 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 15:00:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:59,848 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-24 15:00:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:59,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 15:00:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:59,857 INFO L225 Difference]: With dead ends: 2711 [2018-10-24 15:00:59,858 INFO L226 Difference]: Without dead ends: 1786 [2018-10-24 15:00:59,860 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 15:00:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-24 15:00:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-24 15:00:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-24 15:00:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-24 15:00:59,897 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 202 [2018-10-24 15:00:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:59,897 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-24 15:00:59,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-24 15:00:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-24 15:00:59,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:59,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,903 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:59,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash -400117653, now seen corresponding path program 1 times [2018-10-24 15:00:59,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:59,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:59,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:59,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:59,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:59,994 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-24 15:01:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:01,294 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-24 15:01:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:01,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-10-24 15:01:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:01,314 INFO L225 Difference]: With dead ends: 5215 [2018-10-24 15:01:01,314 INFO L226 Difference]: Without dead ends: 3433 [2018-10-24 15:01:01,318 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 15:01:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-24 15:01:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-24 15:01:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-24 15:01:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-24 15:01:01,400 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 204 [2018-10-24 15:01:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:01,400 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-24 15:01:01,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-24 15:01:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 15:01:01,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:01,411 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:01,412 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:01,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1921534150, now seen corresponding path program 1 times [2018-10-24 15:01:01,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:01,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:01,666 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 15:01:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:01,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:01,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:01,668 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-10-24 15:01:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:02,459 INFO L93 Difference]: Finished difference Result 10229 states and 15374 transitions. [2018-10-24 15:01:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:02,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-24 15:01:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:02,487 INFO L225 Difference]: With dead ends: 10229 [2018-10-24 15:01:02,488 INFO L226 Difference]: Without dead ends: 6815 [2018-10-24 15:01:02,494 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 15:01:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-10-24 15:01:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 6811. [2018-10-24 15:01:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6811 states. [2018-10-24 15:01:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10227 transitions. [2018-10-24 15:01:02,624 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 10227 transitions. Word has length 218 [2018-10-24 15:01:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:02,624 INFO L481 AbstractCegarLoop]: Abstraction has 6811 states and 10227 transitions. [2018-10-24 15:01:02,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 10227 transitions. [2018-10-24 15:01:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 15:01:02,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:02,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,641 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:02,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1444628378, now seen corresponding path program 1 times [2018-10-24 15:01:02,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:02,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:02,962 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 15:01:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:03,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:03,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:03,004 INFO L87 Difference]: Start difference. First operand 6811 states and 10227 transitions. Second operand 4 states. [2018-10-24 15:01:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:05,788 INFO L93 Difference]: Finished difference Result 26790 states and 40398 transitions. [2018-10-24 15:01:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:05,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-10-24 15:01:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:05,856 INFO L225 Difference]: With dead ends: 26790 [2018-10-24 15:01:05,856 INFO L226 Difference]: Without dead ends: 19981 [2018-10-24 15:01:05,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19981 states. [2018-10-24 15:01:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19981 to 13345. [2018-10-24 15:01:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13345 states. [2018-10-24 15:01:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13345 states to 13345 states and 19034 transitions. [2018-10-24 15:01:06,142 INFO L78 Accepts]: Start accepts. Automaton has 13345 states and 19034 transitions. Word has length 219 [2018-10-24 15:01:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:06,142 INFO L481 AbstractCegarLoop]: Abstraction has 13345 states and 19034 transitions. [2018-10-24 15:01:06,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13345 states and 19034 transitions. [2018-10-24 15:01:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 15:01:06,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:06,166 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,166 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:06,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -626143831, now seen corresponding path program 1 times [2018-10-24 15:01:06,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:06,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:06,370 INFO L87 Difference]: Start difference. First operand 13345 states and 19034 transitions. Second operand 4 states. [2018-10-24 15:01:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:09,324 INFO L93 Difference]: Finished difference Result 50146 states and 71178 transitions. [2018-10-24 15:01:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:09,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-10-24 15:01:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:09,396 INFO L225 Difference]: With dead ends: 50146 [2018-10-24 15:01:09,396 INFO L226 Difference]: Without dead ends: 36803 [2018-10-24 15:01:09,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:01:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36803 states. [2018-10-24 15:01:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36803 to 36799. [2018-10-24 15:01:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36799 states. [2018-10-24 15:01:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36799 states to 36799 states and 46035 transitions. [2018-10-24 15:01:09,945 INFO L78 Accepts]: Start accepts. Automaton has 36799 states and 46035 transitions. Word has length 232 [2018-10-24 15:01:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:09,945 INFO L481 AbstractCegarLoop]: Abstraction has 36799 states and 46035 transitions. [2018-10-24 15:01:09,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36799 states and 46035 transitions. [2018-10-24 15:01:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-24 15:01:10,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:10,001 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:01:10,001 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:10,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 405445227, now seen corresponding path program 1 times [2018-10-24 15:01:10,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 15:01:10,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:10,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:10,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:10,194 INFO L87 Difference]: Start difference. First operand 36799 states and 46035 transitions. Second operand 3 states. [2018-10-24 15:01:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:11,749 INFO L93 Difference]: Finished difference Result 71506 states and 89059 transitions. [2018-10-24 15:01:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:11,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-10-24 15:01:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:11,810 INFO L225 Difference]: With dead ends: 71506 [2018-10-24 15:01:11,810 INFO L226 Difference]: Without dead ends: 34709 [2018-10-24 15:01:11,844 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 15:01:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2018-10-24 15:01:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34709. [2018-10-24 15:01:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34709 states. [2018-10-24 15:01:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34709 states to 34709 states and 42256 transitions. [2018-10-24 15:01:12,242 INFO L78 Accepts]: Start accepts. Automaton has 34709 states and 42256 transitions. Word has length 253 [2018-10-24 15:01:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:12,242 INFO L481 AbstractCegarLoop]: Abstraction has 34709 states and 42256 transitions. [2018-10-24 15:01:12,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34709 states and 42256 transitions. [2018-10-24 15:01:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-24 15:01:12,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:12,289 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:12,289 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:12,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -48503042, now seen corresponding path program 1 times [2018-10-24 15:01:12,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:12,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:12,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:13,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:13,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:13,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:13,072 INFO L87 Difference]: Start difference. First operand 34709 states and 42256 transitions. Second operand 4 states. [2018-10-24 15:01:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:14,728 INFO L93 Difference]: Finished difference Result 71880 states and 87371 transitions. [2018-10-24 15:01:14,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:14,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-24 15:01:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:14,776 INFO L225 Difference]: With dead ends: 71880 [2018-10-24 15:01:14,776 INFO L226 Difference]: Without dead ends: 37173 [2018-10-24 15:01:14,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:14,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37173 states. [2018-10-24 15:01:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37173 to 37169. [2018-10-24 15:01:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-10-24 15:01:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 44967 transitions. [2018-10-24 15:01:15,262 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 44967 transitions. Word has length 270 [2018-10-24 15:01:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:15,262 INFO L481 AbstractCegarLoop]: Abstraction has 37169 states and 44967 transitions. [2018-10-24 15:01:15,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 44967 transitions. [2018-10-24 15:01:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-24 15:01:15,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:15,287 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,288 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:15,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785836, now seen corresponding path program 1 times [2018-10-24 15:01:15,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-24 15:01:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:15,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:15,526 INFO L87 Difference]: Start difference. First operand 37169 states and 44967 transitions. Second operand 3 states. [2018-10-24 15:01:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:17,322 INFO L93 Difference]: Finished difference Result 74338 states and 89936 transitions. [2018-10-24 15:01:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:17,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-10-24 15:01:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:17,372 INFO L225 Difference]: With dead ends: 74338 [2018-10-24 15:01:17,372 INFO L226 Difference]: Without dead ends: 37171 [2018-10-24 15:01:17,405 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 15:01:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37171 states. [2018-10-24 15:01:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37171 to 37169. [2018-10-24 15:01:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-10-24 15:01:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 43322 transitions. [2018-10-24 15:01:18,160 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 43322 transitions. Word has length 306 [2018-10-24 15:01:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:18,160 INFO L481 AbstractCegarLoop]: Abstraction has 37169 states and 43322 transitions. [2018-10-24 15:01:18,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 43322 transitions. [2018-10-24 15:01:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-24 15:01:18,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:18,180 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:18,180 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:18,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 370758085, now seen corresponding path program 1 times [2018-10-24 15:01:18,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:18,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 15:01:18,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:18,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:18,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:18,433 INFO L87 Difference]: Start difference. First operand 37169 states and 43322 transitions. Second operand 3 states. [2018-10-24 15:01:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:19,903 INFO L93 Difference]: Finished difference Result 72636 states and 84664 transitions. [2018-10-24 15:01:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:19,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2018-10-24 15:01:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:19,941 INFO L225 Difference]: With dead ends: 72636 [2018-10-24 15:01:19,942 INFO L226 Difference]: Without dead ends: 35469 [2018-10-24 15:01:19,967 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 15:01:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-10-24 15:01:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 35465. [2018-10-24 15:01:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-24 15:01:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40049 transitions. [2018-10-24 15:01:20,301 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40049 transitions. Word has length 319 [2018-10-24 15:01:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:20,301 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40049 transitions. [2018-10-24 15:01:20,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40049 transitions. [2018-10-24 15:01:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-24 15:01:20,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:20,319 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:20,320 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:20,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -539370600, now seen corresponding path program 1 times [2018-10-24 15:01:20,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:20,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 15:01:20,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:20,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:20,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:20,557 INFO L87 Difference]: Start difference. First operand 35465 states and 40049 transitions. Second operand 3 states. [2018-10-24 15:01:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:21,959 INFO L93 Difference]: Finished difference Result 69289 states and 78346 transitions. [2018-10-24 15:01:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:21,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-10-24 15:01:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:21,997 INFO L225 Difference]: With dead ends: 69289 [2018-10-24 15:01:21,997 INFO L226 Difference]: Without dead ends: 35463 [2018-10-24 15:01:22,010 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 15:01:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35463 states. [2018-10-24 15:01:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35463 to 35463. [2018-10-24 15:01:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35463 states. [2018-10-24 15:01:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35463 states to 35463 states and 40045 transitions. [2018-10-24 15:01:22,288 INFO L78 Accepts]: Start accepts. Automaton has 35463 states and 40045 transitions. Word has length 326 [2018-10-24 15:01:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:22,288 INFO L481 AbstractCegarLoop]: Abstraction has 35463 states and 40045 transitions. [2018-10-24 15:01:22,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 35463 states and 40045 transitions. [2018-10-24 15:01:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 15:01:22,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:22,308 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,308 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:22,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1874209680, now seen corresponding path program 1 times [2018-10-24 15:01:22,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-24 15:01:22,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:22,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:22,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:22,640 INFO L87 Difference]: Start difference. First operand 35463 states and 40045 transitions. Second operand 4 states. [2018-10-24 15:01:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:24,727 INFO L93 Difference]: Finished difference Result 70515 states and 79664 transitions. [2018-10-24 15:01:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:24,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-24 15:01:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:24,767 INFO L225 Difference]: With dead ends: 70515 [2018-10-24 15:01:24,767 INFO L226 Difference]: Without dead ends: 35054 [2018-10-24 15:01:24,791 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:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35054 states. [2018-10-24 15:01:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35054 to 35053. [2018-10-24 15:01:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35053 states. [2018-10-24 15:01:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35053 states to 35053 states and 38475 transitions. [2018-10-24 15:01:25,138 INFO L78 Accepts]: Start accepts. Automaton has 35053 states and 38475 transitions. Word has length 342 [2018-10-24 15:01:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:25,138 INFO L481 AbstractCegarLoop]: Abstraction has 35053 states and 38475 transitions. [2018-10-24 15:01:25,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 35053 states and 38475 transitions. [2018-10-24 15:01:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 15:01:25,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:25,151 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:25,152 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:25,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash -71967826, now seen corresponding path program 1 times [2018-10-24 15:01:25,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:25,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:25,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:25,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 15:01:25,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:25,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:25,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:25,514 INFO L87 Difference]: Start difference. First operand 35053 states and 38475 transitions. Second operand 4 states. [2018-10-24 15:01:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:27,842 INFO L93 Difference]: Finished difference Result 71140 states and 78180 transitions. [2018-10-24 15:01:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:27,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-24 15:01:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:27,878 INFO L225 Difference]: With dead ends: 71140 [2018-10-24 15:01:27,878 INFO L226 Difference]: Without dead ends: 37316 [2018-10-24 15:01:27,899 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:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37316 states. [2018-10-24 15:01:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37316 to 37303. [2018-10-24 15:01:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37303 states. [2018-10-24 15:01:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37303 states to 37303 states and 40895 transitions. [2018-10-24 15:01:28,783 INFO L78 Accepts]: Start accepts. Automaton has 37303 states and 40895 transitions. Word has length 342 [2018-10-24 15:01:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:28,783 INFO L481 AbstractCegarLoop]: Abstraction has 37303 states and 40895 transitions. [2018-10-24 15:01:28,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 37303 states and 40895 transitions. [2018-10-24 15:01:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-24 15:01:28,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:28,796 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:28,796 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:28,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1553900648, now seen corresponding path program 1 times [2018-10-24 15:01:28,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:28,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:28,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-24 15:01:29,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:29,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:29,007 INFO L87 Difference]: Start difference. First operand 37303 states and 40895 transitions. Second operand 3 states. [2018-10-24 15:01:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:30,401 INFO L93 Difference]: Finished difference Result 91825 states and 100517 transitions. [2018-10-24 15:01:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:30,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-24 15:01:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:30,464 INFO L225 Difference]: With dead ends: 91825 [2018-10-24 15:01:30,464 INFO L226 Difference]: Without dead ends: 55751 [2018-10-24 15:01:30,489 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 15:01:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55751 states. [2018-10-24 15:01:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55751 to 55748. [2018-10-24 15:01:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55748 states. [2018-10-24 15:01:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55748 states to 55748 states and 60878 transitions. [2018-10-24 15:01:31,058 INFO L78 Accepts]: Start accepts. Automaton has 55748 states and 60878 transitions. Word has length 348 [2018-10-24 15:01:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:31,058 INFO L481 AbstractCegarLoop]: Abstraction has 55748 states and 60878 transitions. [2018-10-24 15:01:31,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 55748 states and 60878 transitions. [2018-10-24 15:01:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-24 15:01:31,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:31,079 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:31,080 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:31,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:31,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2132933612, now seen corresponding path program 1 times [2018-10-24 15:01:31,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:31,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-24 15:01:31,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:31,327 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 15:01:31,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:31,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-24 15:01:31,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:31,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 15:01:31,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 15:01:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 15:01:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 15:01:31,844 INFO L87 Difference]: Start difference. First operand 55748 states and 60878 transitions. Second operand 6 states. [2018-10-24 15:01:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:39,934 INFO L93 Difference]: Finished difference Result 159029 states and 174177 transitions. [2018-10-24 15:01:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 15:01:39,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2018-10-24 15:01:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:40,058 INFO L225 Difference]: With dead ends: 159029 [2018-10-24 15:01:40,058 INFO L226 Difference]: Without dead ends: 104714 [2018-10-24 15:01:40,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:01:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104714 states. [2018-10-24 15:01:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104714 to 92259. [2018-10-24 15:01:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92259 states. [2018-10-24 15:01:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92259 states to 92259 states and 99762 transitions. [2018-10-24 15:01:41,838 INFO L78 Accepts]: Start accepts. Automaton has 92259 states and 99762 transitions. Word has length 356 [2018-10-24 15:01:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:41,838 INFO L481 AbstractCegarLoop]: Abstraction has 92259 states and 99762 transitions. [2018-10-24 15:01:41,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 15:01:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 92259 states and 99762 transitions. [2018-10-24 15:01:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-24 15:01:41,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:41,887 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:41,888 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:41,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash -232365187, now seen corresponding path program 1 times [2018-10-24 15:01:41,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:41,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:41,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:41,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-24 15:01:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:42,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:42,571 INFO L87 Difference]: Start difference. First operand 92259 states and 99762 transitions. Second operand 4 states. [2018-10-24 15:01:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:45,241 INFO L93 Difference]: Finished difference Result 342810 states and 371050 transitions. [2018-10-24 15:01:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:45,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 457 [2018-10-24 15:01:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:45,566 INFO L225 Difference]: With dead ends: 342810 [2018-10-24 15:01:45,566 INFO L226 Difference]: Without dead ends: 251984 [2018-10-24 15:01:45,641 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:01:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251984 states. [2018-10-24 15:01:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251984 to 162590. [2018-10-24 15:01:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162590 states. [2018-10-24 15:01:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162590 states to 162590 states and 176047 transitions. [2018-10-24 15:01:47,923 INFO L78 Accepts]: Start accepts. Automaton has 162590 states and 176047 transitions. Word has length 457 [2018-10-24 15:01:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:47,924 INFO L481 AbstractCegarLoop]: Abstraction has 162590 states and 176047 transitions. [2018-10-24 15:01:47,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 162590 states and 176047 transitions. [2018-10-24 15:01:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-24 15:01:47,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:47,979 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:47,979 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:47,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1170531438, now seen corresponding path program 1 times [2018-10-24 15:01:47,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:47,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 15:01:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:49,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:49,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:49,627 INFO L87 Difference]: Start difference. First operand 162590 states and 176047 transitions. Second operand 3 states. [2018-10-24 15:01:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:52,090 INFO L93 Difference]: Finished difference Result 433844 states and 468648 transitions. [2018-10-24 15:01:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:52,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2018-10-24 15:01:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:52,410 INFO L225 Difference]: With dead ends: 433844 [2018-10-24 15:01:52,410 INFO L226 Difference]: Without dead ends: 272687 [2018-10-24 15:01:52,527 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 15:01:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272687 states. [2018-10-24 15:01:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272687 to 272685. [2018-10-24 15:01:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272685 states. [2018-10-24 15:01:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272685 states to 272685 states and 292971 transitions. [2018-10-24 15:01:56,643 INFO L78 Accepts]: Start accepts. Automaton has 272685 states and 292971 transitions. Word has length 479 [2018-10-24 15:01:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:56,643 INFO L481 AbstractCegarLoop]: Abstraction has 272685 states and 292971 transitions. [2018-10-24 15:01:56,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 272685 states and 292971 transitions. [2018-10-24 15:01:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-24 15:01:56,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:56,709 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:56,710 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 208632150, now seen corresponding path program 1 times [2018-10-24 15:01:56,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:57,253 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:01:57,443 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 15:01:57,698 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 15:01:57,917 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:01:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 396 proven. 29 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-24 15:01:59,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:59,368 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 15:01:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:59,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 350 proven. 52 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 15:01:59,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 15:01:59,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-24 15:01:59,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 15:01:59,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 15:01:59,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:01:59,993 INFO L87 Difference]: Start difference. First operand 272685 states and 292971 transitions. Second operand 12 states. [2018-10-24 15:02:00,327 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 15:02:00,853 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 15:02:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:28,855 INFO L93 Difference]: Finished difference Result 2094409 states and 2248871 transitions. [2018-10-24 15:02:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 15:02:28,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 481 [2018-10-24 15:02:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:31,393 INFO L225 Difference]: With dead ends: 2094409 [2018-10-24 15:02:31,393 INFO L226 Difference]: Without dead ends: 1821715 [2018-10-24 15:02:31,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 15:02:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821715 states. [2018-10-24 15:03:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821715 to 1819564. [2018-10-24 15:03:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819564 states. [2018-10-24 15:03:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819564 states to 1819564 states and 1941351 transitions. [2018-10-24 15:03:33,785 INFO L78 Accepts]: Start accepts. Automaton has 1819564 states and 1941351 transitions. Word has length 481 [2018-10-24 15:03:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:33,785 INFO L481 AbstractCegarLoop]: Abstraction has 1819564 states and 1941351 transitions. [2018-10-24 15:03:33,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 15:03:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1819564 states and 1941351 transitions. [2018-10-24 15:03:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-10-24 15:03:34,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:34,199 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:03:34,199 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:34,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1947764577, now seen corresponding path program 1 times [2018-10-24 15:03:34,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:34,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:34,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:34,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:34,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-24 15:03:35,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:35,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:35,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:35,093 INFO L87 Difference]: Start difference. First operand 1819564 states and 1941351 transitions. Second operand 3 states. Received shutdown request... [2018-10-24 15:03:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:54,444 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:03:54,449 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:03:54,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:03:54 BoogieIcfgContainer [2018-10-24 15:03:54,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:03:54,450 INFO L168 Benchmark]: Toolchain (without parser) took 192987.55 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,451 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:03:54,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1200.44 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 324.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -840.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,453 INFO L168 Benchmark]: Boogie Preprocessor took 149.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,454 INFO L168 Benchmark]: RCFGBuilder took 5154.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,455 INFO L168 Benchmark]: TraceAbstraction took 186152.77 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:54,460 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1200.44 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 324.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -840.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5154.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186152.77 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while BasicCegarLoop was constructing difference of abstraction (1819564states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1845407 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.0s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 97.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5320 SDtfs, 20058 SDslu, 3917 SDs, 0 SdLazy, 23517 SolverSat, 5349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 937 GetRequests, 861 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1819564occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 75.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 111420 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 7162 NumberOfCodeBlocks, 7162 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7140 ConstructedInterpolants, 0 QuantifiedInterpolants, 6321400 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 5089/5174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown