java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label26_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:06,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:06,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:06,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:06,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:06,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:06,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:06,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:06,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:06,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:06,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:06,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:06,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:06,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:06,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:06,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:06,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:06,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:06,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:06,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:06,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:06,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:06,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:06,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:06,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:06,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:06,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:06,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:06,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:06,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:06,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:06,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:06,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:06,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:06,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:06,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:06,302 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 13:17:06,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:06,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:06,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:06,337 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:06,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:06,338 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:06,339 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:06,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:06,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:06,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:06,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:06,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:06,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:06,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:06,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:06,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:06,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:06,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:06,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:06,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:06,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:06,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:06,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:06,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:06,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:06,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:06,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:06,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:06,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:06,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:06,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:06,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:06,429 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:06,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label26_false-unreach-call.c [2018-10-24 13:17:06,501 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9caf089a6/641eaea95efa4e9c82485883a649f9ae/FLAG9addf0859 [2018-10-24 13:17:07,177 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:07,178 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label26_false-unreach-call.c [2018-10-24 13:17:07,196 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9caf089a6/641eaea95efa4e9c82485883a649f9ae/FLAG9addf0859 [2018-10-24 13:17:07,212 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9caf089a6/641eaea95efa4e9c82485883a649f9ae [2018-10-24 13:17:07,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:07,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:07,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:07,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:07,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:07,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07, skipping insertion in model container [2018-10-24 13:17:07,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:07,352 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:08,048 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:08,054 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:08,378 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:08,401 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:08,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08 WrapperNode [2018-10-24 13:17:08,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:08,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:08,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:08,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:08,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:08,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:08,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:08,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:08,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (1/1) ... [2018-10-24 13:17:08,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:08,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:08,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:08,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:08,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (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 13:17:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:08,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:15,416 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:15,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:15 BoogieIcfgContainer [2018-10-24 13:17:15,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:15,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:15,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:15,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:15,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:07" (1/3) ... [2018-10-24 13:17:15,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:15, skipping insertion in model container [2018-10-24 13:17:15,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:08" (2/3) ... [2018-10-24 13:17:15,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:15, skipping insertion in model container [2018-10-24 13:17:15,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:15" (3/3) ... [2018-10-24 13:17:15,426 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label26_false-unreach-call.c [2018-10-24 13:17:15,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:15,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:15,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:15,503 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:15,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:15,505 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:15,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:15,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:15,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:15,505 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:15,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:15,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-24 13:17:15,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:15,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:15,553 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:15,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash 86356338, now seen corresponding path program 1 times [2018-10-24 13:17:15,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:15,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:15,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:16,485 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 13:17:16,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:16,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:16,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:16,518 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:20,111 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 13:17:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:20,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-10-24 13:17:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:20,138 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 13:17:20,138 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 13:17:20,143 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 13:17:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 13:17:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 13:17:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 13:17:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 13:17:20,238 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 157 [2018-10-24 13:17:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:20,240 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 13:17:20,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 13:17:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 13:17:20,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:20,254 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:20,254 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:20,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1844619565, now seen corresponding path program 1 times [2018-10-24 13:17:20,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:20,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:20,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:20,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:20,437 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 13:17:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:22,267 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 13:17:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:22,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-10-24 13:17:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:22,276 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 13:17:22,277 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 13:17:22,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 13:17:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 13:17:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 13:17:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 13:17:22,333 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 166 [2018-10-24 13:17:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:22,334 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 13:17:22,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 13:17:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 13:17:22,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:22,338 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:22,338 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:22,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1927005330, now seen corresponding path program 1 times [2018-10-24 13:17:22,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 13:17:22,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:22,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:22,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:22,481 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 13:17:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:24,367 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-10-24 13:17:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:24,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-10-24 13:17:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:24,386 INFO L225 Difference]: With dead ends: 3977 [2018-10-24 13:17:24,386 INFO L226 Difference]: Without dead ends: 2648 [2018-10-24 13:17:24,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-24 13:17:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-10-24 13:17:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-10-24 13:17:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-10-24 13:17:24,474 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 180 [2018-10-24 13:17:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:24,475 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-10-24 13:17:24,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-10-24 13:17:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 13:17:24,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:24,481 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:24,481 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:24,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1926473982, now seen corresponding path program 1 times [2018-10-24 13:17:24,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:24,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:24,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:17:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:24,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:24,637 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-10-24 13:17:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:25,434 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-10-24 13:17:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:25,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-24 13:17:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:25,449 INFO L225 Difference]: With dead ends: 5250 [2018-10-24 13:17:25,449 INFO L226 Difference]: Without dead ends: 2607 [2018-10-24 13:17:25,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-10-24 13:17:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-10-24 13:17:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-10-24 13:17:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-10-24 13:17:25,506 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 188 [2018-10-24 13:17:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:25,506 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-10-24 13:17:25,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-10-24 13:17:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 13:17:25,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:25,511 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:25,511 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:25,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2109687030, now seen corresponding path program 1 times [2018-10-24 13:17:25,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:25,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:26,057 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 13:17:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:26,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:26,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:17:26,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:17:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:17:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:26,111 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-10-24 13:17:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:30,277 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-10-24 13:17:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:17:30,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2018-10-24 13:17:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:30,295 INFO L225 Difference]: With dead ends: 6279 [2018-10-24 13:17:30,295 INFO L226 Difference]: Without dead ends: 3674 [2018-10-24 13:17:30,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-10-24 13:17:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-10-24 13:17:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-10-24 13:17:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-10-24 13:17:30,355 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 197 [2018-10-24 13:17:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:30,356 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-10-24 13:17:30,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:17:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-10-24 13:17:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 13:17:30,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:30,362 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:30,362 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:30,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash -64223766, now seen corresponding path program 1 times [2018-10-24 13:17:30,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:30,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 13:17:30,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:30,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 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 13:17:30,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:30,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 13:17:30,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:30,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 13:17:30,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:30,849 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-10-24 13:17:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:34,514 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-10-24 13:17:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:34,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-10-24 13:17:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:34,557 INFO L225 Difference]: With dead ends: 12048 [2018-10-24 13:17:34,557 INFO L226 Difference]: Without dead ends: 9035 [2018-10-24 13:17:34,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-10-24 13:17:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-10-24 13:17:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-10-24 13:17:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-10-24 13:17:34,726 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 233 [2018-10-24 13:17:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:34,727 INFO L481 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-10-24 13:17:34,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-10-24 13:17:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 13:17:34,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:34,737 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:34,737 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:34,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash 303507697, now seen corresponding path program 1 times [2018-10-24 13:17:34,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:34,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:34,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:34,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:34,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:34,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:34,956 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-10-24 13:17:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:37,650 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-10-24 13:17:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:37,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-24 13:17:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:37,695 INFO L225 Difference]: With dead ends: 17361 [2018-10-24 13:17:37,695 INFO L226 Difference]: Without dead ends: 11341 [2018-10-24 13:17:37,705 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 13:17:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-10-24 13:17:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-10-24 13:17:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-10-24 13:17:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-10-24 13:17:37,923 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 233 [2018-10-24 13:17:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:37,924 INFO L481 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-10-24 13:17:37,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-10-24 13:17:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 13:17:37,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:37,939 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:37,939 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:37,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1403004464, now seen corresponding path program 1 times [2018-10-24 13:17:37,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:38,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:38,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:38,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:38,475 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-10-24 13:17:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:42,964 INFO L93 Difference]: Finished difference Result 41584 states and 58255 transitions. [2018-10-24 13:17:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:42,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-10-24 13:17:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:43,028 INFO L225 Difference]: With dead ends: 41584 [2018-10-24 13:17:43,028 INFO L226 Difference]: Without dead ends: 30249 [2018-10-24 13:17:43,048 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 13:17:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30249 states. [2018-10-24 13:17:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30249 to 21129. [2018-10-24 13:17:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-24 13:17:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-10-24 13:17:43,403 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 236 [2018-10-24 13:17:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:43,404 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-10-24 13:17:43,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-10-24 13:17:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-24 13:17:43,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:43,426 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:43,426 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:43,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 73363639, now seen corresponding path program 1 times [2018-10-24 13:17:43,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 13:17:43,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:43,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:43,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:43,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:43,570 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-10-24 13:17:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:45,157 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-10-24 13:17:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:45,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-10-24 13:17:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:45,188 INFO L225 Difference]: With dead ends: 42264 [2018-10-24 13:17:45,189 INFO L226 Difference]: Without dead ends: 21137 [2018-10-24 13:17:45,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-10-24 13:17:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-10-24 13:17:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-24 13:17:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-10-24 13:17:45,490 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 240 [2018-10-24 13:17:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:45,490 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-10-24 13:17:45,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-10-24 13:17:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-24 13:17:45,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:45,510 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:45,510 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:45,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 178918531, now seen corresponding path program 1 times [2018-10-24 13:17:45,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:45,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:46,246 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 13:17:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:46,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:46,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:46,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 13:17:46,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 13:17:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 13:17:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 13:17:46,528 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 8 states. [2018-10-24 13:17:46,783 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-24 13:17:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:55,118 INFO L93 Difference]: Finished difference Result 104170 states and 126332 transitions. [2018-10-24 13:17:55,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 13:17:55,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 253 [2018-10-24 13:17:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:55,212 INFO L225 Difference]: With dead ends: 104170 [2018-10-24 13:17:55,212 INFO L226 Difference]: Without dead ends: 83043 [2018-10-24 13:17:55,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 13:17:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83043 states. [2018-10-24 13:17:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83043 to 47808. [2018-10-24 13:17:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47808 states. [2018-10-24 13:17:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47808 states to 47808 states and 56836 transitions. [2018-10-24 13:17:56,067 INFO L78 Accepts]: Start accepts. Automaton has 47808 states and 56836 transitions. Word has length 253 [2018-10-24 13:17:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:56,068 INFO L481 AbstractCegarLoop]: Abstraction has 47808 states and 56836 transitions. [2018-10-24 13:17:56,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 13:17:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 47808 states and 56836 transitions. [2018-10-24 13:17:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-24 13:17:56,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:56,101 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:56,101 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:56,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1261689772, now seen corresponding path program 1 times [2018-10-24 13:17:56,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 13:17:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:56,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:56,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:56,284 INFO L87 Difference]: Start difference. First operand 47808 states and 56836 transitions. Second operand 3 states. [2018-10-24 13:17:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:58,062 INFO L93 Difference]: Finished difference Result 125865 states and 148659 transitions. [2018-10-24 13:17:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:58,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-24 13:17:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:58,166 INFO L225 Difference]: With dead ends: 125865 [2018-10-24 13:17:58,167 INFO L226 Difference]: Without dead ends: 78059 [2018-10-24 13:17:58,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78059 states. [2018-10-24 13:17:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78059 to 78052. [2018-10-24 13:17:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78052 states. [2018-10-24 13:17:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78052 states to 78052 states and 91657 transitions. [2018-10-24 13:17:59,114 INFO L78 Accepts]: Start accepts. Automaton has 78052 states and 91657 transitions. Word has length 261 [2018-10-24 13:17:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:59,114 INFO L481 AbstractCegarLoop]: Abstraction has 78052 states and 91657 transitions. [2018-10-24 13:17:59,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78052 states and 91657 transitions. [2018-10-24 13:17:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 13:17:59,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:59,150 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:59,151 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:59,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash -562279040, now seen corresponding path program 1 times [2018-10-24 13:17:59,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:59,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:59,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 13:17:59,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:59,369 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 13:17:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:59,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-24 13:17:59,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:59,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 13:17:59,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:17:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:17:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:17:59,625 INFO L87 Difference]: Start difference. First operand 78052 states and 91657 transitions. Second operand 6 states. [2018-10-24 13:18:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:05,574 INFO L93 Difference]: Finished difference Result 351194 states and 413707 transitions. [2018-10-24 13:18:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 13:18:05,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2018-10-24 13:18:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:05,943 INFO L225 Difference]: With dead ends: 351194 [2018-10-24 13:18:05,944 INFO L226 Difference]: Without dead ends: 273144 [2018-10-24 13:18:06,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 13:18:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273144 states. [2018-10-24 13:18:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273144 to 248385. [2018-10-24 13:18:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248385 states. [2018-10-24 13:18:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248385 states to 248385 states and 284120 transitions. [2018-10-24 13:18:09,533 INFO L78 Accepts]: Start accepts. Automaton has 248385 states and 284120 transitions. Word has length 269 [2018-10-24 13:18:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:09,533 INFO L481 AbstractCegarLoop]: Abstraction has 248385 states and 284120 transitions. [2018-10-24 13:18:09,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:18:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 248385 states and 284120 transitions. [2018-10-24 13:18:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-24 13:18:09,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:09,581 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:09,581 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:09,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1301455411, now seen corresponding path program 1 times [2018-10-24 13:18:09,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:09,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:09,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 13:18:09,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:09,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:09,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:09,901 INFO L87 Difference]: Start difference. First operand 248385 states and 284120 transitions. Second operand 4 states. [2018-10-24 13:18:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:14,518 INFO L93 Difference]: Finished difference Result 445075 states and 509099 transitions. [2018-10-24 13:18:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:14,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2018-10-24 13:18:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:14,731 INFO L225 Difference]: With dead ends: 445075 [2018-10-24 13:18:14,731 INFO L226 Difference]: Without dead ends: 196692 [2018-10-24 13:18:14,801 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 13:18:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196692 states. [2018-10-24 13:18:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196692 to 196684. [2018-10-24 13:18:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196684 states. [2018-10-24 13:18:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196684 states to 196684 states and 220546 transitions. [2018-10-24 13:18:16,748 INFO L78 Accepts]: Start accepts. Automaton has 196684 states and 220546 transitions. Word has length 295 [2018-10-24 13:18:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:16,749 INFO L481 AbstractCegarLoop]: Abstraction has 196684 states and 220546 transitions. [2018-10-24 13:18:16,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 196684 states and 220546 transitions. [2018-10-24 13:18:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-24 13:18:16,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:16,792 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:16,793 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:16,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -8058268, now seen corresponding path program 1 times [2018-10-24 13:18:16,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 13:18:18,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:18,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:18,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:18,700 INFO L87 Difference]: Start difference. First operand 196684 states and 220546 transitions. Second operand 4 states. [2018-10-24 13:18:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:23,082 INFO L93 Difference]: Finished difference Result 627284 states and 702290 transitions. [2018-10-24 13:18:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:23,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2018-10-24 13:18:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:23,641 INFO L225 Difference]: With dead ends: 627284 [2018-10-24 13:18:23,642 INFO L226 Difference]: Without dead ends: 430602 [2018-10-24 13:18:23,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430602 states. [2018-10-24 13:18:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430602 to 332506. [2018-10-24 13:18:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332506 states. [2018-10-24 13:18:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332506 states to 332506 states and 369847 transitions. [2018-10-24 13:18:36,706 INFO L78 Accepts]: Start accepts. Automaton has 332506 states and 369847 transitions. Word has length 299 [2018-10-24 13:18:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:36,706 INFO L481 AbstractCegarLoop]: Abstraction has 332506 states and 369847 transitions. [2018-10-24 13:18:36,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 332506 states and 369847 transitions. [2018-10-24 13:18:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-24 13:18:36,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:36,764 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:36,765 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:36,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 440553292, now seen corresponding path program 1 times [2018-10-24 13:18:36,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 13:18:37,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:37,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:37,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:37,865 INFO L87 Difference]: Start difference. First operand 332506 states and 369847 transitions. Second operand 3 states. [2018-10-24 13:18:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:41,300 INFO L93 Difference]: Finished difference Result 625137 states and 695741 transitions. [2018-10-24 13:18:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:41,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-10-24 13:18:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:41,663 INFO L225 Difference]: With dead ends: 625137 [2018-10-24 13:18:41,664 INFO L226 Difference]: Without dead ends: 292633 [2018-10-24 13:18:43,158 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 13:18:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292633 states. [2018-10-24 13:18:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292633 to 290554. [2018-10-24 13:18:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290554 states. [2018-10-24 13:18:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290554 states to 290554 states and 315133 transitions. [2018-10-24 13:18:47,842 INFO L78 Accepts]: Start accepts. Automaton has 290554 states and 315133 transitions. Word has length 344 [2018-10-24 13:18:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:47,843 INFO L481 AbstractCegarLoop]: Abstraction has 290554 states and 315133 transitions. [2018-10-24 13:18:47,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 290554 states and 315133 transitions. [2018-10-24 13:18:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-24 13:18:47,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:47,899 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:47,900 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:47,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -819918005, now seen corresponding path program 1 times [2018-10-24 13:18:47,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:48,416 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 13:18:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-10-24 13:18:48,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:48,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:48,603 INFO L87 Difference]: Start difference. First operand 290554 states and 315133 transitions. Second operand 5 states. [2018-10-24 13:18:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:54,312 INFO L93 Difference]: Finished difference Result 811461 states and 876830 transitions. [2018-10-24 13:18:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:18:54,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2018-10-24 13:18:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:54,939 INFO L225 Difference]: With dead ends: 811461 [2018-10-24 13:18:54,939 INFO L226 Difference]: Without dead ends: 520909 [2018-10-24 13:18:55,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520909 states. [2018-10-24 13:19:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520909 to 477628. [2018-10-24 13:19:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477628 states. [2018-10-24 13:19:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477628 states to 477628 states and 516489 transitions. [2018-10-24 13:19:10,071 INFO L78 Accepts]: Start accepts. Automaton has 477628 states and 516489 transitions. Word has length 350 [2018-10-24 13:19:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:10,072 INFO L481 AbstractCegarLoop]: Abstraction has 477628 states and 516489 transitions. [2018-10-24 13:19:10,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:19:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 477628 states and 516489 transitions. [2018-10-24 13:19:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-24 13:19:10,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:10,115 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:19:10,115 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:10,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -244001844, now seen corresponding path program 1 times [2018-10-24 13:19:10,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-24 13:19:10,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:10,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:10,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:10,594 INFO L87 Difference]: Start difference. First operand 477628 states and 516489 transitions. Second operand 4 states. [2018-10-24 13:19:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:20,088 INFO L93 Difference]: Finished difference Result 1653585 states and 1786528 transitions. [2018-10-24 13:19:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:20,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 364 [2018-10-24 13:19:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:21,828 INFO L225 Difference]: With dead ends: 1653585 [2018-10-24 13:19:21,828 INFO L226 Difference]: Without dead ends: 1175959 [2018-10-24 13:19:22,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175959 states. [2018-10-24 13:19:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175959 to 722887. [2018-10-24 13:19:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722887 states. [2018-10-24 13:19:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722887 states to 722887 states and 780165 transitions. [2018-10-24 13:19:49,105 INFO L78 Accepts]: Start accepts. Automaton has 722887 states and 780165 transitions. Word has length 364 [2018-10-24 13:19:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:49,105 INFO L481 AbstractCegarLoop]: Abstraction has 722887 states and 780165 transitions. [2018-10-24 13:19:49,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 722887 states and 780165 transitions. [2018-10-24 13:19:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 13:19:49,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:49,150 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:19:49,150 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:49,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 459997797, now seen corresponding path program 1 times [2018-10-24 13:19:49,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-24 13:19:49,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:49,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:49,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:19:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:19:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:19:49,434 INFO L87 Difference]: Start difference. First operand 722887 states and 780165 transitions. Second operand 3 states. [2018-10-24 13:20:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:00,333 INFO L93 Difference]: Finished difference Result 1905776 states and 2054550 transitions. [2018-10-24 13:20:00,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:20:00,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-24 13:20:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:01,901 INFO L225 Difference]: With dead ends: 1905776 [2018-10-24 13:20:01,902 INFO L226 Difference]: Without dead ends: 1153989 [2018-10-24 13:20:02,251 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 13:20:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153989 states. Received shutdown request... [2018-10-24 13:20:20,738 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 13:20:20,742 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 13:20:20,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:20:20 BoogieIcfgContainer [2018-10-24 13:20:20,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 13:20:20,744 INFO L168 Benchmark]: Toolchain (without parser) took 193519.42 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,745 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 13:20:20,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1175.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 288.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,747 INFO L168 Benchmark]: Boogie Preprocessor took 159.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,748 INFO L168 Benchmark]: RCFGBuilder took 6565.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.9 MB). Peak memory consumption was 272.9 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,749 INFO L168 Benchmark]: TraceAbstraction took 185324.13 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:20,754 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1175.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 288.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 159.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6565.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.9 MB). Peak memory consumption was 272.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185324.13 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1503]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1503). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 185.2s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 88.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5359 SDtfs, 16355 SDslu, 6444 SDs, 0 SdLazy, 18465 SolverSat, 4129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 783 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722887occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 86.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 669360 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5401 NumberOfCodeBlocks, 5401 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5380 ConstructedInterpolants, 0 QuantifiedInterpolants, 2812532 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1481 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 3106/3130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown