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_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:52:02,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:52:02,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:52:02,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:52:02,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:52:02,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:52:02,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:52:02,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:52:02,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:52:02,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:52:02,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:52:02,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:52:02,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:52:02,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:52:02,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:52:02,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:52:02,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:52:02,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:52:02,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:52:02,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:52:02,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:52:02,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:52:02,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:52:02,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:52:02,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:52:02,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:52:02,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:52:02,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:52:02,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:52:02,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:52:02,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:52:02,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:52:02,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:52:02,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:52:02,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:52:02,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:52:02,337 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:52:02,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:52:02,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:52:02,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:52:02,354 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:52:02,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:52:02,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:52:02,355 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:52:02,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:52:02,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:52:02,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:52:02,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:52:02,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:52:02,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:52:02,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:52:02,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:52:02,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:52:02,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:52:02,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:52:02,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:52:02,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:52:02,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:52:02,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:52:02,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:52:02,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:52:02,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:52:02,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:52:02,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:52:02,359 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:52:02,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:52:02,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:52:02,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:52:02,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:52:02,434 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:52:02,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-23 18:52:02,504 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/056b0812f/05f28f98302248dab474b3b4d9d9f605/FLAG9f477bd54 [2018-10-23 18:52:03,235 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:52:03,235 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-23 18:52:03,259 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/056b0812f/05f28f98302248dab474b3b4d9d9f605/FLAG9f477bd54 [2018-10-23 18:52:03,280 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/056b0812f/05f28f98302248dab474b3b4d9d9f605 [2018-10-23 18:52:03,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:52:03,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:52:03,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:52:03,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:52:03,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:52:03,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:52:03" (1/1) ... [2018-10-23 18:52:03,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3b7c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:03, skipping insertion in model container [2018-10-23 18:52:03,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:52:03" (1/1) ... [2018-10-23 18:52:03,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:52:03,402 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:52:04,077 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:52:04,083 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:52:04,445 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:52:04,467 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:52:04,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04 WrapperNode [2018-10-23 18:52:04,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:52:04,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:52:04,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:52:04,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:52:04,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:52:04,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:52:04,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:52:04,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:52:04,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... [2018-10-23 18:52:04,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:52:04,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:52:04,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:52:04,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:52:04,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:52:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:52:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:52:05,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:52:10,414 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:52:10,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:52:10 BoogieIcfgContainer [2018-10-23 18:52:10,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:52:10,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:52:10,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:52:10,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:52:10,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:52:03" (1/3) ... [2018-10-23 18:52:10,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ab5946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:52:10, skipping insertion in model container [2018-10-23 18:52:10,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:52:04" (2/3) ... [2018-10-23 18:52:10,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ab5946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:52:10, skipping insertion in model container [2018-10-23 18:52:10,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:52:10" (3/3) ... [2018-10-23 18:52:10,425 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label16_true-unreach-call.c [2018-10-23 18:52:10,436 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:52:10,445 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:52:10,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:52:10,505 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:52:10,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:52:10,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:52:10,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:52:10,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:52:10,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:52:10,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:52:10,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:52:10,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:52:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:52:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-23 18:52:10,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:10,557 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] [2018-10-23 18:52:10,560 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:10,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1181546316, now seen corresponding path program 1 times [2018-10-23 18:52:10,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:10,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:11,455 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:52:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:52:11,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:11,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:11,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:11,583 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:52:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:14,984 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-23 18:52:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:14,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-23 18:52:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:15,015 INFO L225 Difference]: With dead ends: 1075 [2018-10-23 18:52:15,015 INFO L226 Difference]: Without dead ends: 765 [2018-10-23 18:52:15,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-23 18:52:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-23 18:52:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-23 18:52:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-23 18:52:15,127 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 166 [2018-10-23 18:52:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:15,129 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-23 18:52:15,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-23 18:52:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-23 18:52:15,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:15,139 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] [2018-10-23 18:52:15,139 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:15,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash 857919243, now seen corresponding path program 1 times [2018-10-23 18:52:15,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:15,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:15,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:52:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:52:15,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:15,390 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-23 18:52:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:17,471 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-23 18:52:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:17,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-23 18:52:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:17,479 INFO L225 Difference]: With dead ends: 1465 [2018-10-23 18:52:17,479 INFO L226 Difference]: Without dead ends: 947 [2018-10-23 18:52:17,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-23 18:52:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-23 18:52:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-23 18:52:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-23 18:52:17,535 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 175 [2018-10-23 18:52:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:17,536 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-23 18:52:17,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-23 18:52:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-23 18:52:17,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:17,543 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:17,545 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:17,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash 954136543, now seen corresponding path program 1 times [2018-10-23 18:52:17,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:17,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:17,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:17,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:17,875 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-23 18:52:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:22,049 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-23 18:52:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:22,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-23 18:52:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:22,061 INFO L225 Difference]: With dead ends: 2693 [2018-10-23 18:52:22,061 INFO L226 Difference]: Without dead ends: 1764 [2018-10-23 18:52:22,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-23 18:52:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-23 18:52:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-23 18:52:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-23 18:52:22,101 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 183 [2018-10-23 18:52:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:22,102 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-23 18:52:22,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-23 18:52:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-23 18:52:22,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:22,107 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-10-23 18:52:22,108 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:22,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454467, now seen corresponding path program 1 times [2018-10-23 18:52:22,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:22,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:22,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:22,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:22,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:22,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:22,237 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-23 18:52:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:24,304 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-23 18:52:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:24,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-23 18:52:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:24,325 INFO L225 Difference]: With dead ends: 5132 [2018-10-23 18:52:24,326 INFO L226 Difference]: Without dead ends: 3386 [2018-10-23 18:52:24,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-23 18:52:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-23 18:52:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-23 18:52:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-23 18:52:24,414 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 190 [2018-10-23 18:52:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:24,414 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-23 18:52:24,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-23 18:52:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-23 18:52:24,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:24,425 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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] [2018-10-23 18:52:24,425 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:24,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1025659639, now seen corresponding path program 1 times [2018-10-23 18:52:24,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:24,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:24,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:24,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:52:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:24,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:24,607 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-23 18:52:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:25,919 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-23 18:52:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:25,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-23 18:52:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:25,949 INFO L225 Difference]: With dead ends: 10035 [2018-10-23 18:52:25,950 INFO L226 Difference]: Without dead ends: 6652 [2018-10-23 18:52:25,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-23 18:52:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-23 18:52:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:52:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-23 18:52:26,077 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 197 [2018-10-23 18:52:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:26,077 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-23 18:52:26,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-23 18:52:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-23 18:52:26,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:26,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:26,091 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:26,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2138090957, now seen corresponding path program 1 times [2018-10-23 18:52:26,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:52:26,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:26,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:26,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:26,385 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-23 18:52:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:28,927 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-23 18:52:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:28,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-23 18:52:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:28,954 INFO L225 Difference]: With dead ends: 13297 [2018-10-23 18:52:28,954 INFO L226 Difference]: Without dead ends: 6650 [2018-10-23 18:52:28,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-23 18:52:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-23 18:52:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:52:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-23 18:52:29,071 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 197 [2018-10-23 18:52:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:29,071 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-23 18:52:29,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-23 18:52:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-23 18:52:29,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:29,086 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 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] [2018-10-23 18:52:29,086 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:29,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash 253101429, now seen corresponding path program 1 times [2018-10-23 18:52:29,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:29,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:29,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-23 18:52:29,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:29,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:52:29,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:29,238 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-23 18:52:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:30,029 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-23 18:52:30,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:30,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-23 18:52:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:30,074 INFO L225 Difference]: With dead ends: 13264 [2018-10-23 18:52:30,074 INFO L226 Difference]: Without dead ends: 6617 [2018-10-23 18:52:30,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-23 18:52:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-23 18:52:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-23 18:52:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-23 18:52:30,183 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-23 18:52:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:30,183 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-23 18:52:30,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-23 18:52:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-23 18:52:30,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:30,196 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:30,196 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:30,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1785953004, now seen corresponding path program 1 times [2018-10-23 18:52:30,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:30,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:30,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:30,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:30,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:30,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:30,360 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-23 18:52:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:32,582 INFO L93 Difference]: Finished difference Result 15882 states and 19789 transitions. [2018-10-23 18:52:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:32,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-23 18:52:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:32,601 INFO L225 Difference]: With dead ends: 15882 [2018-10-23 18:52:32,602 INFO L226 Difference]: Without dead ends: 9267 [2018-10-23 18:52:32,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9267 states. [2018-10-23 18:52:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9267 to 9267. [2018-10-23 18:52:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2018-10-23 18:52:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 10892 transitions. [2018-10-23 18:52:32,727 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 10892 transitions. Word has length 222 [2018-10-23 18:52:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:32,727 INFO L481 AbstractCegarLoop]: Abstraction has 9267 states and 10892 transitions. [2018-10-23 18:52:32,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 10892 transitions. [2018-10-23 18:52:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-23 18:52:32,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:32,745 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:32,745 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:32,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash 324309577, now seen corresponding path program 1 times [2018-10-23 18:52:32,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-23 18:52:32,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:32,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:32,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:32,932 INFO L87 Difference]: Start difference. First operand 9267 states and 10892 transitions. Second operand 3 states. [2018-10-23 18:52:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:34,579 INFO L93 Difference]: Finished difference Result 26494 states and 31046 transitions. [2018-10-23 18:52:34,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:34,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-23 18:52:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:34,613 INFO L225 Difference]: With dead ends: 26494 [2018-10-23 18:52:34,614 INFO L226 Difference]: Without dead ends: 17229 [2018-10-23 18:52:34,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2018-10-23 18:52:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 17225. [2018-10-23 18:52:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-23 18:52:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19750 transitions. [2018-10-23 18:52:34,854 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19750 transitions. Word has length 249 [2018-10-23 18:52:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:34,854 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19750 transitions. [2018-10-23 18:52:34,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19750 transitions. [2018-10-23 18:52:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-23 18:52:34,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:34,879 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:34,879 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:34,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash 585273194, now seen corresponding path program 1 times [2018-10-23 18:52:34,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-23 18:52:35,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:35,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:35,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:35,198 INFO L87 Difference]: Start difference. First operand 17225 states and 19750 transitions. Second operand 4 states. [2018-10-23 18:52:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:37,147 INFO L93 Difference]: Finished difference Result 34456 states and 39512 transitions. [2018-10-23 18:52:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:37,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-10-23 18:52:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:37,180 INFO L225 Difference]: With dead ends: 34456 [2018-10-23 18:52:37,181 INFO L226 Difference]: Without dead ends: 17233 [2018-10-23 18:52:37,202 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-23 18:52:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2018-10-23 18:52:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17225. [2018-10-23 18:52:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-23 18:52:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19548 transitions. [2018-10-23 18:52:37,616 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19548 transitions. Word has length 256 [2018-10-23 18:52:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:37,616 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19548 transitions. [2018-10-23 18:52:37,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19548 transitions. [2018-10-23 18:52:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-23 18:52:37,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:37,643 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:37,644 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:37,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -491815230, now seen corresponding path program 1 times [2018-10-23 18:52:37,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:37,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:37,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-23 18:52:38,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:52:38,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:52:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:52:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:52:38,128 INFO L87 Difference]: Start difference. First operand 17225 states and 19548 transitions. Second operand 5 states. [2018-10-23 18:52:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:40,334 INFO L93 Difference]: Finished difference Result 52673 states and 59425 transitions. [2018-10-23 18:52:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:52:40,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-23 18:52:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:40,386 INFO L225 Difference]: With dead ends: 52673 [2018-10-23 18:52:40,386 INFO L226 Difference]: Without dead ends: 35450 [2018-10-23 18:52:40,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:52:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35450 states. [2018-10-23 18:52:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35450 to 35445. [2018-10-23 18:52:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35445 states. [2018-10-23 18:52:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35445 states to 35445 states and 39830 transitions. [2018-10-23 18:52:40,872 INFO L78 Accepts]: Start accepts. Automaton has 35445 states and 39830 transitions. Word has length 269 [2018-10-23 18:52:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:40,872 INFO L481 AbstractCegarLoop]: Abstraction has 35445 states and 39830 transitions. [2018-10-23 18:52:40,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:52:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 35445 states and 39830 transitions. [2018-10-23 18:52:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-23 18:52:40,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:40,906 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:40,906 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -517916135, now seen corresponding path program 1 times [2018-10-23 18:52:40,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:40,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:40,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:40,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:40,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:41,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:41,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:41,176 INFO L87 Difference]: Start difference. First operand 35445 states and 39830 transitions. Second operand 4 states. [2018-10-23 18:52:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:43,508 INFO L93 Difference]: Finished difference Result 73150 states and 82339 transitions. [2018-10-23 18:52:43,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:43,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-10-23 18:52:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:43,553 INFO L225 Difference]: With dead ends: 73150 [2018-10-23 18:52:43,553 INFO L226 Difference]: Without dead ends: 37707 [2018-10-23 18:52:43,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37707 states. [2018-10-23 18:52:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37707 to 37695. [2018-10-23 18:52:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-23 18:52:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 42345 transitions. [2018-10-23 18:52:44,062 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 42345 transitions. Word has length 277 [2018-10-23 18:52:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:44,062 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 42345 transitions. [2018-10-23 18:52:44,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 42345 transitions. [2018-10-23 18:52:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-23 18:52:44,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:44,074 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:44,075 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:44,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1028863245, now seen corresponding path program 1 times [2018-10-23 18:52:44,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:44,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:44,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:44,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:44,463 INFO L87 Difference]: Start difference. First operand 37695 states and 42345 transitions. Second operand 4 states. [2018-10-23 18:52:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:46,818 INFO L93 Difference]: Finished difference Result 75399 states and 84709 transitions. [2018-10-23 18:52:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:46,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-10-23 18:52:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:46,863 INFO L225 Difference]: With dead ends: 75399 [2018-10-23 18:52:46,864 INFO L226 Difference]: Without dead ends: 37706 [2018-10-23 18:52:46,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37706 states. [2018-10-23 18:52:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37706 to 37695. [2018-10-23 18:52:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-23 18:52:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 41937 transitions. [2018-10-23 18:52:47,258 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 41937 transitions. Word has length 278 [2018-10-23 18:52:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:47,258 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 41937 transitions. [2018-10-23 18:52:47,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 41937 transitions. [2018-10-23 18:52:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-23 18:52:47,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:47,270 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:52:47,270 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:47,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash -929080328, now seen corresponding path program 1 times [2018-10-23 18:52:47,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:47,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:47,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:52:47,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:47,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:47,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:47,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:47,958 INFO L87 Difference]: Start difference. First operand 37695 states and 41937 transitions. Second operand 3 states. [2018-10-23 18:52:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:49,543 INFO L93 Difference]: Finished difference Result 73343 states and 81685 transitions. [2018-10-23 18:52:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:49,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-10-23 18:52:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:49,593 INFO L225 Difference]: With dead ends: 73343 [2018-10-23 18:52:49,594 INFO L226 Difference]: Without dead ends: 35650 [2018-10-23 18:52:49,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35650 states. [2018-10-23 18:52:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35650 to 35647. [2018-10-23 18:52:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35647 states. [2018-10-23 18:52:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35647 states to 35647 states and 38821 transitions. [2018-10-23 18:52:50,039 INFO L78 Accepts]: Start accepts. Automaton has 35647 states and 38821 transitions. Word has length 294 [2018-10-23 18:52:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:50,040 INFO L481 AbstractCegarLoop]: Abstraction has 35647 states and 38821 transitions. [2018-10-23 18:52:50,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35647 states and 38821 transitions. [2018-10-23 18:52:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-23 18:52:50,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:50,055 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:50,056 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:50,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash 896536754, now seen corresponding path program 1 times [2018-10-23 18:52:50,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:50,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:50,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:52:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:50,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:50,521 INFO L87 Difference]: Start difference. First operand 35647 states and 38821 transitions. Second operand 4 states. [2018-10-23 18:52:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:52,256 INFO L93 Difference]: Finished difference Result 135836 states and 147858 transitions. [2018-10-23 18:52:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:52,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2018-10-23 18:52:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:52,360 INFO L225 Difference]: With dead ends: 135836 [2018-10-23 18:52:52,360 INFO L226 Difference]: Without dead ends: 100191 [2018-10-23 18:52:52,396 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-23 18:52:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100191 states. [2018-10-23 18:52:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100191 to 64134. [2018-10-23 18:52:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64134 states. [2018-10-23 18:52:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64134 states to 64134 states and 69822 transitions. [2018-10-23 18:52:53,891 INFO L78 Accepts]: Start accepts. Automaton has 64134 states and 69822 transitions. Word has length 298 [2018-10-23 18:52:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:53,891 INFO L481 AbstractCegarLoop]: Abstraction has 64134 states and 69822 transitions. [2018-10-23 18:52:53,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 64134 states and 69822 transitions. [2018-10-23 18:52:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-23 18:52:53,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:53,906 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 18:52:53,907 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:53,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 126833866, now seen corresponding path program 1 times [2018-10-23 18:52:53,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:53,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-23 18:52:54,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:54,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:52:54,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:54,133 INFO L87 Difference]: Start difference. First operand 64134 states and 69822 transitions. Second operand 3 states. [2018-10-23 18:52:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:56,026 INFO L93 Difference]: Finished difference Result 158805 states and 172541 transitions. [2018-10-23 18:52:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:56,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2018-10-23 18:52:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:56,143 INFO L225 Difference]: With dead ends: 158805 [2018-10-23 18:52:56,143 INFO L226 Difference]: Without dead ends: 94673 [2018-10-23 18:52:56,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94673 states. [2018-10-23 18:52:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94673 to 92616. [2018-10-23 18:52:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92616 states. [2018-10-23 18:52:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92616 states to 92616 states and 100489 transitions. [2018-10-23 18:52:57,157 INFO L78 Accepts]: Start accepts. Automaton has 92616 states and 100489 transitions. Word has length 318 [2018-10-23 18:52:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:57,157 INFO L481 AbstractCegarLoop]: Abstraction has 92616 states and 100489 transitions. [2018-10-23 18:52:57,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 92616 states and 100489 transitions. [2018-10-23 18:52:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-23 18:52:57,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:57,175 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:52:57,175 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:57,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1579485379, now seen corresponding path program 1 times [2018-10-23 18:52:57,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:57,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-23 18:52:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:58,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:58,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:58,238 INFO L87 Difference]: Start difference. First operand 92616 states and 100489 transitions. Second operand 4 states. [2018-10-23 18:53:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:00,559 INFO L93 Difference]: Finished difference Result 268198 states and 290902 transitions. [2018-10-23 18:53:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:00,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-10-23 18:53:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:00,750 INFO L225 Difference]: With dead ends: 268198 [2018-10-23 18:53:00,750 INFO L226 Difference]: Without dead ends: 170869 [2018-10-23 18:53:00,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170869 states. [2018-10-23 18:53:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170869 to 169432. [2018-10-23 18:53:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169432 states. [2018-10-23 18:53:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169432 states to 169432 states and 181761 transitions. [2018-10-23 18:53:02,508 INFO L78 Accepts]: Start accepts. Automaton has 169432 states and 181761 transitions. Word has length 320 [2018-10-23 18:53:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:02,509 INFO L481 AbstractCegarLoop]: Abstraction has 169432 states and 181761 transitions. [2018-10-23 18:53:02,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 169432 states and 181761 transitions. [2018-10-23 18:53:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-23 18:53:03,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:03,350 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 18:53:03,351 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:03,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:03,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1328338570, now seen corresponding path program 1 times [2018-10-23 18:53:03,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:03,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:03,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:03,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:03,694 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:53:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-23 18:53:03,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:03,891 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:53:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:04,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-23 18:53:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:04,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:53:04,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:53:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:53:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:53:04,337 INFO L87 Difference]: Start difference. First operand 169432 states and 181761 transitions. Second operand 6 states. [2018-10-23 18:53:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:13,983 INFO L93 Difference]: Finished difference Result 805370 states and 864039 transitions. [2018-10-23 18:53:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:53:13,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-10-23 18:53:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:14,925 INFO L225 Difference]: With dead ends: 805370 [2018-10-23 18:53:14,925 INFO L226 Difference]: Without dead ends: 635940 [2018-10-23 18:53:15,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:53:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635940 states. [2018-10-23 18:53:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635940 to 602296. [2018-10-23 18:53:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602296 states. [2018-10-23 18:53:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602296 states to 602296 states and 638430 transitions. [2018-10-23 18:53:31,615 INFO L78 Accepts]: Start accepts. Automaton has 602296 states and 638430 transitions. Word has length 326 [2018-10-23 18:53:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:31,616 INFO L481 AbstractCegarLoop]: Abstraction has 602296 states and 638430 transitions. [2018-10-23 18:53:31,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:53:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 602296 states and 638430 transitions. [2018-10-23 18:53:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-23 18:53:31,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:31,653 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:31,654 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:31,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:31,654 INFO L82 PathProgramCache]: Analyzing trace with hash -777036058, now seen corresponding path program 1 times [2018-10-23 18:53:31,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:31,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:31,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 32 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-23 18:53:32,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:32,076 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:53:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:32,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-23 18:53:32,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:32,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-23 18:53:32,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:32,414 INFO L87 Difference]: Start difference. First operand 602296 states and 638430 transitions. Second operand 4 states. [2018-10-23 18:53:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:44,286 INFO L93 Difference]: Finished difference Result 2002725 states and 2120342 transitions. [2018-10-23 18:53:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:44,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-10-23 18:53:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:47,107 INFO L225 Difference]: With dead ends: 2002725 [2018-10-23 18:53:47,107 INFO L226 Difference]: Without dead ends: 1400431 [2018-10-23 18:53:47,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400431 states. [2018-10-23 18:54:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400431 to 922658. [2018-10-23 18:54:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922658 states. [2018-10-23 18:54:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922658 states to 922658 states and 976476 transitions. [2018-10-23 18:54:18,042 INFO L78 Accepts]: Start accepts. Automaton has 922658 states and 976476 transitions. Word has length 378 [2018-10-23 18:54:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:18,043 INFO L481 AbstractCegarLoop]: Abstraction has 922658 states and 976476 transitions. [2018-10-23 18:54:18,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 922658 states and 976476 transitions. [2018-10-23 18:54:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-23 18:54:18,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:18,142 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:54:18,142 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:18,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1084773979, now seen corresponding path program 1 times [2018-10-23 18:54:18,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:18,621 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 18:54:18,813 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:54:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-23 18:54:20,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:20,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 18:54:20,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:54:20,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:54:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:20,678 INFO L87 Difference]: Start difference. First operand 922658 states and 976476 transitions. Second operand 5 states. [2018-10-23 18:54:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:33,183 INFO L93 Difference]: Finished difference Result 2030370 states and 2148031 transitions. [2018-10-23 18:54:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:54:33,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2018-10-23 18:54:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:35,013 INFO L225 Difference]: With dead ends: 2030370 [2018-10-23 18:54:35,013 INFO L226 Difference]: Without dead ends: 1107714 [2018-10-23 18:54:35,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107714 states. [2018-10-23 18:55:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107714 to 965836. [2018-10-23 18:55:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965836 states. [2018-10-23 18:55:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965836 states to 965836 states and 1025224 transitions. [2018-10-23 18:55:06,922 INFO L78 Accepts]: Start accepts. Automaton has 965836 states and 1025224 transitions. Word has length 388 [2018-10-23 18:55:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:06,922 INFO L481 AbstractCegarLoop]: Abstraction has 965836 states and 1025224 transitions. [2018-10-23 18:55:06,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:55:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 965836 states and 1025224 transitions. [2018-10-23 18:55:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-23 18:55:06,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:06,994 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:55:06,994 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:06,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -380448547, now seen corresponding path program 1 times [2018-10-23 18:55:06,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:07,439 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:55:07,646 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 18:55:07,904 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-23 18:55:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 18:55:10,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:55:10,033 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:55:10,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:10,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:55:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-10-23 18:55:10,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:55:10,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-23 18:55:10,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 18:55:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 18:55:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:55:10,433 INFO L87 Difference]: Start difference. First operand 965836 states and 1025224 transitions. Second operand 10 states. Received shutdown request... [2018-10-23 18:55:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-23 18:55:15,691 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:55:15,696 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:55:15,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:55:15 BoogieIcfgContainer [2018-10-23 18:55:15,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:55:15,697 INFO L168 Benchmark]: Toolchain (without parser) took 192403.55 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,698 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:55:15,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 358.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -897.3 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,700 INFO L168 Benchmark]: Boogie Preprocessor took 122.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,701 INFO L168 Benchmark]: RCFGBuilder took 5464.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 248.8 MB). Peak memory consumption was 248.8 MB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,702 INFO L168 Benchmark]: TraceAbstraction took 185279.94 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2018-10-23 18:55:15,706 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1173.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 358.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -897.3 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5464.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 248.8 MB). Peak memory consumption was 248.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185279.94 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1530]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (965836states) and FLOYD_HOARE automaton (currently 14 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (8832 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 185.2s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 83.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5860 SDtfs, 11871 SDslu, 4208 SDs, 0 SdLazy, 21580 SolverSat, 3708 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1220 GetRequests, 1159 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965836occurred in iteration=20, 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: 85.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 693171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 6751 NumberOfCodeBlocks, 6751 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 6184669 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2011 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 4273/4364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown