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/Problem15_label32_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:35:58,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:35:58,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:35:58,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:35:58,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:35:58,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:35:58,352 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:35:58,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:35:58,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:35:58,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:35:58,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:35:58,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:35:58,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:35:58,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:35:58,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:35:58,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:35:58,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:35:58,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:35:58,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:35:58,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:35:58,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:35:58,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:35:58,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:35:58,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:35:58,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:35:58,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:35:58,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:35:58,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:35:58,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:35:58,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:35:58,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:35:58,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:35:58,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:35:58,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:35:58,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:35:58,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:35:58,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:35:58,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:35:58,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:35:58,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:35:58,423 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:35:58,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:35:58,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:35:58,424 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:35:58,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:35:58,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:35:58,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:35:58,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:35:58,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:35:58,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:35:58,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:35:58,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:35:58,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:35:58,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:35:58,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:35:58,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:35:58,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:35:58,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:35:58,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:35:58,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:35:58,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:35:58,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:35:58,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:35:58,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:35:58,429 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:35:58,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:35:58,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:35:58,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:35:58,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:35:58,516 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:35:58,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-10-24 16:35:58,582 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7048520ca/595f1d520e5246b38aad40179a67853e/FLAGd908f1a0b [2018-10-24 16:35:59,292 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:35:59,293 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-10-24 16:35:59,316 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7048520ca/595f1d520e5246b38aad40179a67853e/FLAGd908f1a0b [2018-10-24 16:35:59,338 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7048520ca/595f1d520e5246b38aad40179a67853e [2018-10-24 16:35:59,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:35:59,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:35:59,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:35:59,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:35:59,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:35:59,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:35:59" (1/1) ... [2018-10-24 16:35:59,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25131977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:35:59, skipping insertion in model container [2018-10-24 16:35:59,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:35:59" (1/1) ... [2018-10-24 16:35:59,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:35:59,482 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:36:00,371 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:36:00,375 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:36:00,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:36:00,752 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:36:00,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00 WrapperNode [2018-10-24 16:36:00,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:36:00,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:36:00,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:36:00,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:36:00,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:00,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:36:01,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:36:01,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:36:01,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:36:01,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... [2018-10-24 16:36:01,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:36:01,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:36:01,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:36:01,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:36:01,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:36:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:36:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:36:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:36:10,306 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:36:10,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:36:10 BoogieIcfgContainer [2018-10-24 16:36:10,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:36:10,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:36:10,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:36:10,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:36:10,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:35:59" (1/3) ... [2018-10-24 16:36:10,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f1d664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:36:10, skipping insertion in model container [2018-10-24 16:36:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:36:00" (2/3) ... [2018-10-24 16:36:10,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f1d664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:36:10, skipping insertion in model container [2018-10-24 16:36:10,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:36:10" (3/3) ... [2018-10-24 16:36:10,317 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label32_true-unreach-call.c [2018-10-24 16:36:10,326 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:36:10,335 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:36:10,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:36:10,397 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:36:10,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:36:10,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:36:10,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:36:10,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:36:10,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:36:10,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:36:10,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:36:10,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:36:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-24 16:36:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 16:36:10,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:36:10,439 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] [2018-10-24 16:36:10,442 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:36:10,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:36:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1705034714, now seen corresponding path program 1 times [2018-10-24 16:36:10,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:36:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:36:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:10,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:36:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:36:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:36:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:36:10,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:36:10,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:36:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:36:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:36:10,944 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-24 16:36:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:36:19,130 INFO L93 Difference]: Finished difference Result 1470 states and 2718 transitions. [2018-10-24 16:36:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:36:19,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-24 16:36:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:36:19,162 INFO L225 Difference]: With dead ends: 1470 [2018-10-24 16:36:19,162 INFO L226 Difference]: Without dead ends: 1038 [2018-10-24 16:36:19,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:36:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-10-24 16:36:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2018-10-24 16:36:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-24 16:36:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1670 transitions. [2018-10-24 16:36:19,296 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1670 transitions. Word has length 50 [2018-10-24 16:36:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:36:19,297 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1670 transitions. [2018-10-24 16:36:19,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:36:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1670 transitions. [2018-10-24 16:36:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-24 16:36:19,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:36:19,308 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:36:19,308 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:36:19,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:36:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1442462389, now seen corresponding path program 1 times [2018-10-24 16:36:19,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:36:19,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:36:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:19,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:36:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:36:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:36:19,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:36:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:36:19,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:36:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:36:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:36:19,732 INFO L87 Difference]: Start difference. First operand 1036 states and 1670 transitions. Second operand 4 states. [2018-10-24 16:36:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:36:27,360 INFO L93 Difference]: Finished difference Result 3937 states and 6425 transitions. [2018-10-24 16:36:27,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:36:27,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-10-24 16:36:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:36:27,380 INFO L225 Difference]: With dead ends: 3937 [2018-10-24 16:36:27,380 INFO L226 Difference]: Without dead ends: 2903 [2018-10-24 16:36:27,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:36:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-10-24 16:36:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1937. [2018-10-24 16:36:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-10-24 16:36:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2808 transitions. [2018-10-24 16:36:27,452 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2808 transitions. Word has length 163 [2018-10-24 16:36:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:36:27,453 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 2808 transitions. [2018-10-24 16:36:27,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:36:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2808 transitions. [2018-10-24 16:36:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-24 16:36:27,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:36:27,461 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:36:27,461 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:36:27,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:36:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -504112379, now seen corresponding path program 1 times [2018-10-24 16:36:27,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:36:27,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:36:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:36:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:36:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-24 16:36:28,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:36:28,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:36:28,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:36:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:36:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:36:28,342 INFO L87 Difference]: Start difference. First operand 1937 states and 2808 transitions. Second operand 5 states. [2018-10-24 16:36:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:36:37,235 INFO L93 Difference]: Finished difference Result 4777 states and 6638 transitions. [2018-10-24 16:36:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:36:37,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 324 [2018-10-24 16:36:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:36:37,251 INFO L225 Difference]: With dead ends: 4777 [2018-10-24 16:36:37,252 INFO L226 Difference]: Without dead ends: 2842 [2018-10-24 16:36:37,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:36:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-24 16:36:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2841. [2018-10-24 16:36:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-24 16:36:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3775 transitions. [2018-10-24 16:36:37,309 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3775 transitions. Word has length 324 [2018-10-24 16:36:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:36:37,309 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 3775 transitions. [2018-10-24 16:36:37,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:36:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3775 transitions. [2018-10-24 16:36:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-24 16:36:37,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:36:37,316 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:36:37,316 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:36:37,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:36:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -606678765, now seen corresponding path program 1 times [2018-10-24 16:36:37,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:36:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:36:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:36:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:36:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:36:37,953 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:36:38,520 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-24 16:36:38,847 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-24 16:36:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 88 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:36:39,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:36:39,446 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:36:39,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:36:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:36:39,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:36:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:36:40,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:36:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-10-24 16:36:40,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:36:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:36:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:36:40,027 INFO L87 Difference]: Start difference. First operand 2841 states and 3775 transitions. Second operand 11 states. [2018-10-24 16:37:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:37:06,675 INFO L93 Difference]: Finished difference Result 10306 states and 14223 transitions. [2018-10-24 16:37:06,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 16:37:06,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 398 [2018-10-24 16:37:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:37:06,707 INFO L225 Difference]: With dead ends: 10306 [2018-10-24 16:37:06,707 INFO L226 Difference]: Without dead ends: 7467 [2018-10-24 16:37:06,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 409 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-24 16:37:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-10-24 16:37:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7085. [2018-10-24 16:37:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-10-24 16:37:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 9169 transitions. [2018-10-24 16:37:06,852 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 9169 transitions. Word has length 398 [2018-10-24 16:37:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:37:06,853 INFO L481 AbstractCegarLoop]: Abstraction has 7085 states and 9169 transitions. [2018-10-24 16:37:06,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:37:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 9169 transitions. [2018-10-24 16:37:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-24 16:37:06,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:37:06,871 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:37:06,871 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:37:06,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:37:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1942363427, now seen corresponding path program 1 times [2018-10-24 16:37:06,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:37:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:37:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:06,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:07,613 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:37:08,247 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-24 16:37:08,992 WARN L179 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-24 16:37:09,763 WARN L179 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2018-10-24 16:37:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 301 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 16:37:10,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:37:10,559 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:37:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:10,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:37:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:37:11,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:37:11,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-24 16:37:11,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:37:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:37:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:37:11,099 INFO L87 Difference]: Start difference. First operand 7085 states and 9169 transitions. Second operand 9 states. [2018-10-24 16:37:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:37:22,424 INFO L93 Difference]: Finished difference Result 14846 states and 19047 transitions. [2018-10-24 16:37:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:37:22,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 550 [2018-10-24 16:37:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:37:22,460 INFO L225 Difference]: With dead ends: 14846 [2018-10-24 16:37:22,460 INFO L226 Difference]: Without dead ends: 7763 [2018-10-24 16:37:22,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 554 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:37:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7763 states. [2018-10-24 16:37:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7763 to 7082. [2018-10-24 16:37:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2018-10-24 16:37:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8415 transitions. [2018-10-24 16:37:22,637 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8415 transitions. Word has length 550 [2018-10-24 16:37:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:37:22,639 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8415 transitions. [2018-10-24 16:37:22,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:37:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8415 transitions. [2018-10-24 16:37:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-10-24 16:37:22,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:37:22,660 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:37:22,660 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:37:22,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:37:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1855742868, now seen corresponding path program 1 times [2018-10-24 16:37:22,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:37:22,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:37:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:22,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:37:23,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:37:23,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:37:23,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:37:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:37:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:37:23,623 INFO L87 Difference]: Start difference. First operand 7082 states and 8415 transitions. Second operand 3 states. [2018-10-24 16:37:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:37:27,968 INFO L93 Difference]: Finished difference Result 18397 states and 21875 transitions. [2018-10-24 16:37:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:37:27,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2018-10-24 16:37:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:37:28,005 INFO L225 Difference]: With dead ends: 18397 [2018-10-24 16:37:28,005 INFO L226 Difference]: Without dead ends: 11317 [2018-10-24 16:37:28,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:37:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11317 states. [2018-10-24 16:37:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11317 to 11317. [2018-10-24 16:37:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-10-24 16:37:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 13210 transitions. [2018-10-24 16:37:28,205 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 13210 transitions. Word has length 580 [2018-10-24 16:37:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:37:28,206 INFO L481 AbstractCegarLoop]: Abstraction has 11317 states and 13210 transitions. [2018-10-24 16:37:28,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:37:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 13210 transitions. [2018-10-24 16:37:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-24 16:37:28,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:37:28,230 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:37:28,230 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:37:28,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:37:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash -594189588, now seen corresponding path program 1 times [2018-10-24 16:37:28,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:37:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:37:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:28,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 730 proven. 4 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-10-24 16:37:29,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:37:29,532 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:37:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:29,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:37:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 16:37:30,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:37:30,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 16:37:30,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:37:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:37:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:37:30,035 INFO L87 Difference]: Start difference. First operand 11317 states and 13210 transitions. Second operand 8 states. [2018-10-24 16:37:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:37:41,041 INFO L93 Difference]: Finished difference Result 31201 states and 35896 transitions. [2018-10-24 16:37:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 16:37:41,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 634 [2018-10-24 16:37:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:37:41,070 INFO L225 Difference]: With dead ends: 31201 [2018-10-24 16:37:41,070 INFO L226 Difference]: Without dead ends: 15212 [2018-10-24 16:37:41,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 645 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-10-24 16:37:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15212 states. [2018-10-24 16:37:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15212 to 14912. [2018-10-24 16:37:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14912 states. [2018-10-24 16:37:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 16603 transitions. [2018-10-24 16:37:41,286 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 16603 transitions. Word has length 634 [2018-10-24 16:37:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:37:41,286 INFO L481 AbstractCegarLoop]: Abstraction has 14912 states and 16603 transitions. [2018-10-24 16:37:41,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:37:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 16603 transitions. [2018-10-24 16:37:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-24 16:37:41,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:37:41,317 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:37:41,317 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:37:41,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:37:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1497719346, now seen corresponding path program 1 times [2018-10-24 16:37:41,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:37:41,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:37:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-24 16:37:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:37:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:37:42,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:37:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:37:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:37:42,166 INFO L87 Difference]: Start difference. First operand 14912 states and 16603 transitions. Second operand 5 states. [2018-10-24 16:37:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:37:46,763 INFO L93 Difference]: Finished difference Result 32765 states and 36344 transitions. [2018-10-24 16:37:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:37:46,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 675 [2018-10-24 16:37:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:37:46,782 INFO L225 Difference]: With dead ends: 32765 [2018-10-24 16:37:46,782 INFO L226 Difference]: Without dead ends: 9385 [2018-10-24 16:37:46,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:37:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2018-10-24 16:37:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 6040. [2018-10-24 16:37:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2018-10-24 16:37:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 6235 transitions. [2018-10-24 16:37:46,904 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 6235 transitions. Word has length 675 [2018-10-24 16:37:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:37:46,906 INFO L481 AbstractCegarLoop]: Abstraction has 6040 states and 6235 transitions. [2018-10-24 16:37:46,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:37:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 6235 transitions. [2018-10-24 16:37:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-24 16:37:46,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:37:46,917 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:37:46,918 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:37:46,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:37:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1251493293, now seen corresponding path program 1 times [2018-10-24 16:37:46,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:37:46,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:37:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:46,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:37:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 48 proven. 525 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:37:48,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:37:48,771 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:37:48,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:37:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:37:48,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:37:50,219 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299926) (+ c_~a0~0 300072)) (<= (+ v_prenex_1 44) 0) (<= 0 v_prenex_1))) (exists ((v_~a0~0_825 Int)) (let ((.cse0 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= .cse0 0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 599998)) (not (= .cse1 0)))))) is different from true [2018-10-24 16:37:53,010 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-10-24 16:37:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 350 trivial. 430 not checked. [2018-10-24 16:37:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:37:55,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-24 16:37:55,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:37:55,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:37:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-10-24 16:37:55,055 INFO L87 Difference]: Start difference. First operand 6040 states and 6235 transitions. Second operand 9 states. [2018-10-24 16:38:07,678 WARN L179 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-10-24 16:38:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:08,028 INFO L93 Difference]: Finished difference Result 14322 states and 14794 transitions. [2018-10-24 16:38:08,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:38:08,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 745 [2018-10-24 16:38:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:08,052 INFO L225 Difference]: With dead ends: 14322 [2018-10-24 16:38:08,052 INFO L226 Difference]: Without dead ends: 14320 [2018-10-24 16:38:08,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 742 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-10-24 16:38:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14320 states. [2018-10-24 16:38:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14320 to 11911. [2018-10-24 16:38:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11911 states. [2018-10-24 16:38:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11911 states to 11911 states and 12303 transitions. [2018-10-24 16:38:08,232 INFO L78 Accepts]: Start accepts. Automaton has 11911 states and 12303 transitions. Word has length 745 [2018-10-24 16:38:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:08,233 INFO L481 AbstractCegarLoop]: Abstraction has 11911 states and 12303 transitions. [2018-10-24 16:38:08,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:38:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11911 states and 12303 transitions. [2018-10-24 16:38:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2018-10-24 16:38:08,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:08,251 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:38:08,251 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:08,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash 917863768, now seen corresponding path program 1 times [2018-10-24 16:38:08,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:08,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 16:38:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:38:09,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:38:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:38:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:09,223 INFO L87 Difference]: Start difference. First operand 11911 states and 12303 transitions. Second operand 3 states. [2018-10-24 16:38:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:10,972 INFO L93 Difference]: Finished difference Result 30725 states and 31745 transitions. [2018-10-24 16:38:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:38:10,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 803 [2018-10-24 16:38:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:11,002 INFO L225 Difference]: With dead ends: 30725 [2018-10-24 16:38:11,002 INFO L226 Difference]: Without dead ends: 19116 [2018-10-24 16:38:11,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19116 states. [2018-10-24 16:38:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19116 to 17607. [2018-10-24 16:38:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17607 states. [2018-10-24 16:38:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17607 states to 17607 states and 18123 transitions. [2018-10-24 16:38:11,237 INFO L78 Accepts]: Start accepts. Automaton has 17607 states and 18123 transitions. Word has length 803 [2018-10-24 16:38:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:11,238 INFO L481 AbstractCegarLoop]: Abstraction has 17607 states and 18123 transitions. [2018-10-24 16:38:11,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:38:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 17607 states and 18123 transitions. [2018-10-24 16:38:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-10-24 16:38:11,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:11,255 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:11,256 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:11,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1325868944, now seen corresponding path program 1 times [2018-10-24 16:38:11,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:11,778 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:38:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 888 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-10-24 16:38:12,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:38:12,227 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:38:12,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:12,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:38:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 976 proven. 77 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-10-24 16:38:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:38:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-10-24 16:38:13,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:38:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:38:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:38:13,410 INFO L87 Difference]: Start difference. First operand 17607 states and 18123 transitions. Second operand 9 states. [2018-10-24 16:38:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:20,551 INFO L93 Difference]: Finished difference Result 40027 states and 41228 transitions. [2018-10-24 16:38:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 16:38:20,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 824 [2018-10-24 16:38:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:20,577 INFO L225 Difference]: With dead ends: 40027 [2018-10-24 16:38:20,577 INFO L226 Difference]: Without dead ends: 22722 [2018-10-24 16:38:20,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 827 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:38:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22722 states. [2018-10-24 16:38:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22722 to 18806. [2018-10-24 16:38:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18806 states. [2018-10-24 16:38:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18806 states to 18806 states and 19284 transitions. [2018-10-24 16:38:20,882 INFO L78 Accepts]: Start accepts. Automaton has 18806 states and 19284 transitions. Word has length 824 [2018-10-24 16:38:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:20,883 INFO L481 AbstractCegarLoop]: Abstraction has 18806 states and 19284 transitions. [2018-10-24 16:38:20,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:38:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 18806 states and 19284 transitions. [2018-10-24 16:38:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-24 16:38:20,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:20,905 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:20,905 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash -855129057, now seen corresponding path program 1 times [2018-10-24 16:38:20,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:20,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:20,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:20,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:20,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-24 16:38:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:38:21,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:38:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:38:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:21,922 INFO L87 Difference]: Start difference. First operand 18806 states and 19284 transitions. Second operand 3 states. [2018-10-24 16:38:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:23,740 INFO L93 Difference]: Finished difference Result 32949 states and 33809 transitions. [2018-10-24 16:38:23,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:38:23,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 830 [2018-10-24 16:38:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:23,758 INFO L225 Difference]: With dead ends: 32949 [2018-10-24 16:38:23,758 INFO L226 Difference]: Without dead ends: 18502 [2018-10-24 16:38:23,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18502 states. [2018-10-24 16:38:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18502 to 17602. [2018-10-24 16:38:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17602 states. [2018-10-24 16:38:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17602 states to 17602 states and 17959 transitions. [2018-10-24 16:38:23,975 INFO L78 Accepts]: Start accepts. Automaton has 17602 states and 17959 transitions. Word has length 830 [2018-10-24 16:38:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:23,975 INFO L481 AbstractCegarLoop]: Abstraction has 17602 states and 17959 transitions. [2018-10-24 16:38:23,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:38:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 17602 states and 17959 transitions. [2018-10-24 16:38:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-24 16:38:23,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:23,989 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:38:23,989 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:23,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1881357704, now seen corresponding path program 1 times [2018-10-24 16:38:23,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:23,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-24 16:38:25,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:25,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:38:25,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:38:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:38:25,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:38:25,019 INFO L87 Difference]: Start difference. First operand 17602 states and 17959 transitions. Second operand 4 states. [2018-10-24 16:38:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:27,409 INFO L93 Difference]: Finished difference Result 34907 states and 35620 transitions. [2018-10-24 16:38:27,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:38:27,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 834 [2018-10-24 16:38:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:27,428 INFO L225 Difference]: With dead ends: 34907 [2018-10-24 16:38:27,428 INFO L226 Difference]: Without dead ends: 17607 [2018-10-24 16:38:27,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:38:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17607 states. [2018-10-24 16:38:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17607 to 17302. [2018-10-24 16:38:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17302 states. [2018-10-24 16:38:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17302 states to 17302 states and 17604 transitions. [2018-10-24 16:38:27,789 INFO L78 Accepts]: Start accepts. Automaton has 17302 states and 17604 transitions. Word has length 834 [2018-10-24 16:38:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:27,790 INFO L481 AbstractCegarLoop]: Abstraction has 17302 states and 17604 transitions. [2018-10-24 16:38:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:38:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17302 states and 17604 transitions. [2018-10-24 16:38:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2018-10-24 16:38:27,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:27,806 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:27,806 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:27,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1278165660, now seen corresponding path program 1 times [2018-10-24 16:38:27,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:27,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 16:38:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:38:28,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:38:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:38:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:38:28,627 INFO L87 Difference]: Start difference. First operand 17302 states and 17604 transitions. Second operand 5 states. [2018-10-24 16:38:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:31,162 INFO L93 Difference]: Finished difference Result 23919 states and 24343 transitions. [2018-10-24 16:38:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:38:31,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 836 [2018-10-24 16:38:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:31,185 INFO L225 Difference]: With dead ends: 23919 [2018-10-24 16:38:31,185 INFO L226 Difference]: Without dead ends: 23917 [2018-10-24 16:38:31,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:38:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23917 states. [2018-10-24 16:38:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23917 to 10839. [2018-10-24 16:38:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-10-24 16:38:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 11017 transitions. [2018-10-24 16:38:31,351 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 11017 transitions. Word has length 836 [2018-10-24 16:38:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:31,352 INFO L481 AbstractCegarLoop]: Abstraction has 10839 states and 11017 transitions. [2018-10-24 16:38:31,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:38:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 11017 transitions. [2018-10-24 16:38:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-10-24 16:38:31,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:31,367 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:31,368 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:31,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash 680449423, now seen corresponding path program 1 times [2018-10-24 16:38:31,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:31,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:31,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:31,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:31,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 96 proven. 849 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-10-24 16:38:34,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:38:34,031 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:38:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:34,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:38:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 585 proven. 445 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-10-24 16:38:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:38:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-24 16:38:36,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:38:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:38:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:38:36,280 INFO L87 Difference]: Start difference. First operand 10839 states and 11017 transitions. Second operand 8 states. [2018-10-24 16:38:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:41,722 INFO L93 Difference]: Finished difference Result 29192 states and 29698 transitions. [2018-10-24 16:38:41,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:38:41,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1048 [2018-10-24 16:38:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:41,739 INFO L225 Difference]: With dead ends: 29192 [2018-10-24 16:38:41,739 INFO L226 Difference]: Without dead ends: 18655 [2018-10-24 16:38:41,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:38:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2018-10-24 16:38:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 12341. [2018-10-24 16:38:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12341 states. [2018-10-24 16:38:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12341 states to 12341 states and 12555 transitions. [2018-10-24 16:38:41,895 INFO L78 Accepts]: Start accepts. Automaton has 12341 states and 12555 transitions. Word has length 1048 [2018-10-24 16:38:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:41,896 INFO L481 AbstractCegarLoop]: Abstraction has 12341 states and 12555 transitions. [2018-10-24 16:38:41,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:38:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 12341 states and 12555 transitions. [2018-10-24 16:38:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-24 16:38:41,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:41,910 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:41,910 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -579580417, now seen corresponding path program 1 times [2018-10-24 16:38:41,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:41,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:41,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:42,510 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-24 16:38:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 1334 proven. 0 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2018-10-24 16:38:43,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:43,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:38:43,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:38:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:38:43,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:43,205 INFO L87 Difference]: Start difference. First operand 12341 states and 12555 transitions. Second operand 3 states. [2018-10-24 16:38:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:44,935 INFO L93 Difference]: Finished difference Result 26187 states and 26644 transitions. [2018-10-24 16:38:44,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:38:44,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1088 [2018-10-24 16:38:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:44,949 INFO L225 Difference]: With dead ends: 26187 [2018-10-24 16:38:44,950 INFO L226 Difference]: Without dead ends: 14148 [2018-10-24 16:38:44,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:38:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2018-10-24 16:38:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12038. [2018-10-24 16:38:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12038 states. [2018-10-24 16:38:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12038 states to 12038 states and 12230 transitions. [2018-10-24 16:38:45,091 INFO L78 Accepts]: Start accepts. Automaton has 12038 states and 12230 transitions. Word has length 1088 [2018-10-24 16:38:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:45,092 INFO L481 AbstractCegarLoop]: Abstraction has 12038 states and 12230 transitions. [2018-10-24 16:38:45,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:38:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 12038 states and 12230 transitions. [2018-10-24 16:38:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1174 [2018-10-24 16:38:45,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:45,106 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:45,107 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:45,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash -814989459, now seen corresponding path program 1 times [2018-10-24 16:38:45,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:45,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:46,071 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-24 16:38:46,714 WARN L179 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-24 16:38:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 1687 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2018-10-24 16:38:47,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:47,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:38:47,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:38:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:38:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:38:47,885 INFO L87 Difference]: Start difference. First operand 12038 states and 12230 transitions. Second operand 5 states. [2018-10-24 16:38:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:50,658 INFO L93 Difference]: Finished difference Result 26183 states and 26611 transitions. [2018-10-24 16:38:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:38:50,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1173 [2018-10-24 16:38:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:50,670 INFO L225 Difference]: With dead ends: 26183 [2018-10-24 16:38:50,670 INFO L226 Difference]: Without dead ends: 14447 [2018-10-24 16:38:50,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:38:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14447 states. [2018-10-24 16:38:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14447 to 12938. [2018-10-24 16:38:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12938 states. [2018-10-24 16:38:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12938 states to 12938 states and 13136 transitions. [2018-10-24 16:38:50,797 INFO L78 Accepts]: Start accepts. Automaton has 12938 states and 13136 transitions. Word has length 1173 [2018-10-24 16:38:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:50,798 INFO L481 AbstractCegarLoop]: Abstraction has 12938 states and 13136 transitions. [2018-10-24 16:38:50,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:38:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12938 states and 13136 transitions. [2018-10-24 16:38:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1176 [2018-10-24 16:38:50,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:50,814 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:50,815 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:50,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1364753664, now seen corresponding path program 1 times [2018-10-24 16:38:50,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:50,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:50,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 794 proven. 632 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-10-24 16:38:53,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:38:53,599 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:38:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:53,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:38:54,237 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 14 [2018-10-24 16:38:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 842 proven. 0 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2018-10-24 16:38:55,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:38:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-10-24 16:38:55,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:38:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:38:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:38:55,227 INFO L87 Difference]: Start difference. First operand 12938 states and 13136 transitions. Second operand 7 states. [2018-10-24 16:39:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:01,561 INFO L93 Difference]: Finished difference Result 34904 states and 35432 transitions. [2018-10-24 16:39:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:39:01,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1175 [2018-10-24 16:39:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:01,583 INFO L225 Difference]: With dead ends: 34904 [2018-10-24 16:39:01,583 INFO L226 Difference]: Without dead ends: 22268 [2018-10-24 16:39:01,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:39:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22268 states. [2018-10-24 16:39:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22268 to 12639. [2018-10-24 16:39:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12639 states. [2018-10-24 16:39:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 12823 transitions. [2018-10-24 16:39:01,865 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 12823 transitions. Word has length 1175 [2018-10-24 16:39:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:01,866 INFO L481 AbstractCegarLoop]: Abstraction has 12639 states and 12823 transitions. [2018-10-24 16:39:01,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:39:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 12823 transitions. [2018-10-24 16:39:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-10-24 16:39:01,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:01,889 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:39:01,890 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:01,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 468784148, now seen corresponding path program 1 times [2018-10-24 16:39:01,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:01,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 3071 proven. 60 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2018-10-24 16:39:04,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:39:04,118 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:39:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:04,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:39:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 3008 proven. 87 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-10-24 16:39:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:39:06,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2018-10-24 16:39:06,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:39:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:39:06,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:39:06,425 INFO L87 Difference]: Start difference. First operand 12639 states and 12823 transitions. Second operand 11 states. [2018-10-24 16:39:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:13,470 INFO L93 Difference]: Finished difference Result 26121 states and 26500 transitions. [2018-10-24 16:39:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 16:39:13,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1363 [2018-10-24 16:39:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:13,484 INFO L225 Difference]: With dead ends: 26121 [2018-10-24 16:39:13,485 INFO L226 Difference]: Without dead ends: 15284 [2018-10-24 16:39:13,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1396 GetRequests, 1373 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-10-24 16:39:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15284 states. [2018-10-24 16:39:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15284 to 13241. [2018-10-24 16:39:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13241 states. [2018-10-24 16:39:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13241 states to 13241 states and 13429 transitions. [2018-10-24 16:39:13,650 INFO L78 Accepts]: Start accepts. Automaton has 13241 states and 13429 transitions. Word has length 1363 [2018-10-24 16:39:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:13,651 INFO L481 AbstractCegarLoop]: Abstraction has 13241 states and 13429 transitions. [2018-10-24 16:39:13,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:39:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 13241 states and 13429 transitions. [2018-10-24 16:39:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1590 [2018-10-24 16:39:13,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:13,670 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:39:13,671 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:13,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1571507525, now seen corresponding path program 1 times [2018-10-24 16:39:13,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:13,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:14,712 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2018-10-24 16:39:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5361 backedges. 3084 proven. 852 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-10-24 16:39:16,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:39:16,117 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:39:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:16,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:39:17,831 WARN L179 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 22 [2018-10-24 16:39:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5361 backedges. 3574 proven. 447 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2018-10-24 16:39:24,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:39:24,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-24 16:39:24,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:39:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:39:24,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=1, NotChecked=0, Total=72 [2018-10-24 16:39:24,167 INFO L87 Difference]: Start difference. First operand 13241 states and 13429 transitions. Second operand 9 states. Received shutdown request... [2018-10-24 16:39:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:39:39,234 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:39:39,239 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:39:39,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:39:39 BoogieIcfgContainer [2018-10-24 16:39:39,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:39:39,240 INFO L168 Benchmark]: Toolchain (without parser) took 219888.83 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -187.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,241 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:39:39,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1400.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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 425.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -880.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,243 INFO L168 Benchmark]: Boogie Preprocessor took 218.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,244 INFO L168 Benchmark]: RCFGBuilder took 8908.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 310.7 MB). Peak memory consumption was 310.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,245 INFO L168 Benchmark]: TraceAbstraction took 208930.83 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 1.6 GB in the end (delta: 235.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-24 16:39:39,249 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.26 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 1400.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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 425.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -880.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8908.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 310.7 MB). Peak memory consumption was 310.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208930.83 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 1.6 GB in the end (delta: 235.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (13241states) and FLOYD_HOARE automaton (currently 11 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (9350 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 208.8s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 150.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4105 SDtfs, 30161 SDslu, 3229 SDs, 0 SdLazy, 67073 SolverSat, 7891 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 123.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8547 GetRequests, 8381 SyntacticMatches, 29 SemanticMatches, 137 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18806occurred in iteration=11, 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: 3.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 49399 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 36.5s InterpolantComputationTime, 24008 NumberOfCodeBlocks, 24008 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 23979 ConstructedInterpolants, 617 QuantifiedInterpolants, 111408972 SizeOfPredicates, 11 NumberOfNonLiveVariables, 9709 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 40318/45112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown