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/Problem11_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:07:52,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:07:52,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:07:52,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:07:52,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:07:52,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:07:52,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:07:52,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:07:52,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:07:52,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:07:52,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:07:52,443 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:07:52,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:07:52,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:07:52,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:07:52,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:07:52,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:07:52,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:07:52,470 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:07:52,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:07:52,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:07:52,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:07:52,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:07:52,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:07:52,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:07:52,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:07:52,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:07:52,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:07:52,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:07:52,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:07:52,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:07:52,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:07:52,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:07:52,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:07:52,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:07:52,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:07:52,496 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-26 21:07:52,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:07:52,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:07:52,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:07:52,522 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:07:52,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:07:52,524 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:07:52,524 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:07:52,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:07:52,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:07:52,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:07:52,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:07:52,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:07:52,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:07:52,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:07:52,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:07:52,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:07:52,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:07:52,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:07:52,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:07:52,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:07:52,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:07:52,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:07:52,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:07:52,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:07:52,530 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:07:52,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:07:52,530 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:07:52,530 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:07:52,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:07:52,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:07:52,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:07:52,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:07:52,608 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:07:52,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-10-26 21:07:52,669 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a03b7fc95/f4d554f845ef458a8a5af58629ba24da/FLAG4b9f1a10c [2018-10-26 21:07:53,324 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:07:53,325 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-10-26 21:07:53,348 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a03b7fc95/f4d554f845ef458a8a5af58629ba24da/FLAG4b9f1a10c [2018-10-26 21:07:53,366 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a03b7fc95/f4d554f845ef458a8a5af58629ba24da [2018-10-26 21:07:53,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:07:53,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:07:53,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:07:53,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:07:53,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:07:53,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:07:53" (1/1) ... [2018-10-26 21:07:53,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ad1035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:53, skipping insertion in model container [2018-10-26 21:07:53,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:07:53" (1/1) ... [2018-10-26 21:07:53,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:07:53,470 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:07:54,028 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:07:54,035 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:07:54,245 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:07:54,267 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:07:54,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54 WrapperNode [2018-10-26 21:07:54,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:07:54,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:07:54,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:07:54,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:07:54,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:07:54,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:07:54,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:07:54,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:07:54,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (1/1) ... [2018-10-26 21:07:54,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:07:54,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:07:54,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:07:54,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:07:54,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (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-26 21:07:54,804 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:07:54,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:07:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:07:59,256 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:07:59,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:07:59 BoogieIcfgContainer [2018-10-26 21:07:59,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:07:59,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:07:59,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:07:59,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:07:59,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:07:53" (1/3) ... [2018-10-26 21:07:59,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6d5c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:07:59, skipping insertion in model container [2018-10-26 21:07:59,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:54" (2/3) ... [2018-10-26 21:07:59,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6d5c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:07:59, skipping insertion in model container [2018-10-26 21:07:59,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:07:59" (3/3) ... [2018-10-26 21:07:59,266 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label11_true-unreach-call.c [2018-10-26 21:07:59,276 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:07:59,285 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:07:59,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:07:59,341 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:07:59,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:07:59,342 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:07:59,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:07:59,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:07:59,343 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:07:59,343 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:07:59,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:07:59,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:07:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-26 21:07:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 21:07:59,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:59,385 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] [2018-10-26 21:07:59,388 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:59,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1515441142, now seen corresponding path program 1 times [2018-10-26 21:07:59,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:59,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:59,933 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-26 21:07:59,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:07:59,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:07:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:07:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:59,962 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-26 21:08:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:03,251 INFO L93 Difference]: Finished difference Result 961 states and 1728 transitions. [2018-10-26 21:08:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:03,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-26 21:08:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:03,295 INFO L225 Difference]: With dead ends: 961 [2018-10-26 21:08:03,296 INFO L226 Difference]: Without dead ends: 670 [2018-10-26 21:08:03,304 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-26 21:08:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-26 21:08:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-10-26 21:08:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-26 21:08:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1024 transitions. [2018-10-26 21:08:03,396 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1024 transitions. Word has length 62 [2018-10-26 21:08:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:03,396 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 1024 transitions. [2018-10-26 21:08:03,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1024 transitions. [2018-10-26 21:08:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 21:08:03,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:03,404 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, 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-26 21:08:03,404 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:03,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:03,404 INFO L82 PathProgramCache]: Analyzing trace with hash 439607983, now seen corresponding path program 1 times [2018-10-26 21:08:03,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:03,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:03,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:03,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:03,713 INFO L87 Difference]: Start difference. First operand 670 states and 1024 transitions. Second operand 4 states. [2018-10-26 21:08:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:08,693 INFO L93 Difference]: Finished difference Result 2478 states and 3869 transitions. [2018-10-26 21:08:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:08,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-26 21:08:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:08,708 INFO L225 Difference]: With dead ends: 2478 [2018-10-26 21:08:08,708 INFO L226 Difference]: Without dead ends: 1810 [2018-10-26 21:08:08,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 21:08:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2018-10-26 21:08:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1226. [2018-10-26 21:08:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-26 21:08:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1709 transitions. [2018-10-26 21:08:08,793 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1709 transitions. Word has length 139 [2018-10-26 21:08:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:08,794 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 1709 transitions. [2018-10-26 21:08:08,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1709 transitions. [2018-10-26 21:08:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 21:08:08,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:08,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:08:08,806 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:08,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1794831649, now seen corresponding path program 1 times [2018-10-26 21:08:08,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:08,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:08,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:08,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:09,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:09,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:09,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:09,080 INFO L87 Difference]: Start difference. First operand 1226 states and 1709 transitions. Second operand 4 states. [2018-10-26 21:08:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:11,943 INFO L93 Difference]: Finished difference Result 4138 states and 5963 transitions. [2018-10-26 21:08:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:11,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 21:08:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:11,959 INFO L225 Difference]: With dead ends: 4138 [2018-10-26 21:08:11,959 INFO L226 Difference]: Without dead ends: 2914 [2018-10-26 21:08:11,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2018-10-26 21:08:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2151. [2018-10-26 21:08:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2018-10-26 21:08:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2800 transitions. [2018-10-26 21:08:12,010 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2800 transitions. Word has length 190 [2018-10-26 21:08:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:12,011 INFO L481 AbstractCegarLoop]: Abstraction has 2151 states and 2800 transitions. [2018-10-26 21:08:12,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2800 transitions. [2018-10-26 21:08:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 21:08:12,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:12,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:12,016 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:12,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1441746538, now seen corresponding path program 1 times [2018-10-26 21:08:12,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:12,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 21:08:12,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:12,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:12,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:12,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:12,305 INFO L87 Difference]: Start difference. First operand 2151 states and 2800 transitions. Second operand 4 states. [2018-10-26 21:08:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:19,232 INFO L93 Difference]: Finished difference Result 7462 states and 9948 transitions. [2018-10-26 21:08:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:19,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-10-26 21:08:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:19,256 INFO L225 Difference]: With dead ends: 7462 [2018-10-26 21:08:19,256 INFO L226 Difference]: Without dead ends: 5313 [2018-10-26 21:08:19,259 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-26 21:08:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2018-10-26 21:08:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5111. [2018-10-26 21:08:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5111 states. [2018-10-26 21:08:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 6491 transitions. [2018-10-26 21:08:19,346 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 6491 transitions. Word has length 208 [2018-10-26 21:08:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:19,347 INFO L481 AbstractCegarLoop]: Abstraction has 5111 states and 6491 transitions. [2018-10-26 21:08:19,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 6491 transitions. [2018-10-26 21:08:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-26 21:08:19,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:19,353 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:08:19,354 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:19,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1315185902, now seen corresponding path program 1 times [2018-10-26 21:08:19,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:19,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 21:08:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:19,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:19,565 INFO L87 Difference]: Start difference. First operand 5111 states and 6491 transitions. Second operand 3 states. [2018-10-26 21:08:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:21,917 INFO L93 Difference]: Finished difference Result 11883 states and 15322 transitions. [2018-10-26 21:08:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:21,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-10-26 21:08:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:21,943 INFO L225 Difference]: With dead ends: 11883 [2018-10-26 21:08:21,944 INFO L226 Difference]: Without dead ends: 6959 [2018-10-26 21:08:21,951 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-26 21:08:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2018-10-26 21:08:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6959. [2018-10-26 21:08:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2018-10-26 21:08:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 8768 transitions. [2018-10-26 21:08:22,057 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 8768 transitions. Word has length 252 [2018-10-26 21:08:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:22,058 INFO L481 AbstractCegarLoop]: Abstraction has 6959 states and 8768 transitions. [2018-10-26 21:08:22,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 8768 transitions. [2018-10-26 21:08:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-26 21:08:22,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:22,066 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:22,066 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:22,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 484844517, now seen corresponding path program 1 times [2018-10-26 21:08:22,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:22,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:22,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:22,385 INFO L87 Difference]: Start difference. First operand 6959 states and 8768 transitions. Second operand 4 states. [2018-10-26 21:08:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:25,013 INFO L93 Difference]: Finished difference Result 18185 states and 23270 transitions. [2018-10-26 21:08:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:25,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-10-26 21:08:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:25,052 INFO L225 Difference]: With dead ends: 18185 [2018-10-26 21:08:25,052 INFO L226 Difference]: Without dead ends: 11413 [2018-10-26 21:08:25,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11413 states. [2018-10-26 21:08:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11413 to 11029. [2018-10-26 21:08:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11029 states. [2018-10-26 21:08:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11029 states to 11029 states and 13573 transitions. [2018-10-26 21:08:25,249 INFO L78 Accepts]: Start accepts. Automaton has 11029 states and 13573 transitions. Word has length 268 [2018-10-26 21:08:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:25,250 INFO L481 AbstractCegarLoop]: Abstraction has 11029 states and 13573 transitions. [2018-10-26 21:08:25,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11029 states and 13573 transitions. [2018-10-26 21:08:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-26 21:08:25,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:25,272 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:25,273 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:25,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 955286133, now seen corresponding path program 1 times [2018-10-26 21:08:25,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-26 21:08:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:25,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:25,719 INFO L87 Difference]: Start difference. First operand 11029 states and 13573 transitions. Second operand 3 states. [2018-10-26 21:08:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:26,946 INFO L93 Difference]: Finished difference Result 21499 states and 26551 transitions. [2018-10-26 21:08:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:26,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-10-26 21:08:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:26,968 INFO L225 Difference]: With dead ends: 21499 [2018-10-26 21:08:26,969 INFO L226 Difference]: Without dead ends: 10657 [2018-10-26 21:08:26,979 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-26 21:08:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2018-10-26 21:08:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 10656. [2018-10-26 21:08:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10656 states. [2018-10-26 21:08:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10656 states to 10656 states and 12526 transitions. [2018-10-26 21:08:27,116 INFO L78 Accepts]: Start accepts. Automaton has 10656 states and 12526 transitions. Word has length 344 [2018-10-26 21:08:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:27,117 INFO L481 AbstractCegarLoop]: Abstraction has 10656 states and 12526 transitions. [2018-10-26 21:08:27,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10656 states and 12526 transitions. [2018-10-26 21:08:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-26 21:08:27,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:27,136 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:27,136 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:27,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1928196445, now seen corresponding path program 1 times [2018-10-26 21:08:27,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:27,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-26 21:08:27,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:27,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:27,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:27,427 INFO L87 Difference]: Start difference. First operand 10656 states and 12526 transitions. Second operand 3 states. [2018-10-26 21:08:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:29,672 INFO L93 Difference]: Finished difference Result 23532 states and 27910 transitions. [2018-10-26 21:08:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:29,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-26 21:08:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:29,701 INFO L225 Difference]: With dead ends: 23532 [2018-10-26 21:08:29,702 INFO L226 Difference]: Without dead ends: 13063 [2018-10-26 21:08:29,712 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-26 21:08:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-10-26 21:08:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 12690. [2018-10-26 21:08:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12690 states. [2018-10-26 21:08:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12690 states to 12690 states and 14657 transitions. [2018-10-26 21:08:29,858 INFO L78 Accepts]: Start accepts. Automaton has 12690 states and 14657 transitions. Word has length 347 [2018-10-26 21:08:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:29,859 INFO L481 AbstractCegarLoop]: Abstraction has 12690 states and 14657 transitions. [2018-10-26 21:08:29,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12690 states and 14657 transitions. [2018-10-26 21:08:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-26 21:08:29,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:29,884 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-26 21:08:29,884 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:29,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1873371516, now seen corresponding path program 1 times [2018-10-26 21:08:29,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:29,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:29,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:29,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:29,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-26 21:08:30,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:30,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:30,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:30,333 INFO L87 Difference]: Start difference. First operand 12690 states and 14657 transitions. Second operand 3 states. [2018-10-26 21:08:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:32,473 INFO L93 Difference]: Finished difference Result 27782 states and 32238 transitions. [2018-10-26 21:08:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:32,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-10-26 21:08:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:32,495 INFO L225 Difference]: With dead ends: 27782 [2018-10-26 21:08:32,495 INFO L226 Difference]: Without dead ends: 14535 [2018-10-26 21:08:32,508 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-26 21:08:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14535 states. [2018-10-26 21:08:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14535 to 13795. [2018-10-26 21:08:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13795 states. [2018-10-26 21:08:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13795 states to 13795 states and 15682 transitions. [2018-10-26 21:08:32,683 INFO L78 Accepts]: Start accepts. Automaton has 13795 states and 15682 transitions. Word has length 400 [2018-10-26 21:08:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:32,685 INFO L481 AbstractCegarLoop]: Abstraction has 13795 states and 15682 transitions. [2018-10-26 21:08:32,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13795 states and 15682 transitions. [2018-10-26 21:08:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-26 21:08:32,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:32,712 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:08:32,712 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:32,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 838140476, now seen corresponding path program 1 times [2018-10-26 21:08:32,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 21:08:33,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:33,332 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-26 21:08:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:33,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 21:08:33,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-26 21:08:33,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:33,851 INFO L87 Difference]: Start difference. First operand 13795 states and 15682 transitions. Second operand 5 states. [2018-10-26 21:08:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:43,423 INFO L93 Difference]: Finished difference Result 33722 states and 38667 transitions. [2018-10-26 21:08:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:43,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-26 21:08:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:43,450 INFO L225 Difference]: With dead ends: 33722 [2018-10-26 21:08:43,451 INFO L226 Difference]: Without dead ends: 20114 [2018-10-26 21:08:43,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20114 states. [2018-10-26 21:08:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20114 to 14159. [2018-10-26 21:08:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14159 states. [2018-10-26 21:08:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14159 states to 14159 states and 16088 transitions. [2018-10-26 21:08:43,706 INFO L78 Accepts]: Start accepts. Automaton has 14159 states and 16088 transitions. Word has length 405 [2018-10-26 21:08:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:43,707 INFO L481 AbstractCegarLoop]: Abstraction has 14159 states and 16088 transitions. [2018-10-26 21:08:43,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 14159 states and 16088 transitions. [2018-10-26 21:08:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-26 21:08:43,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:43,732 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:08:43,732 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:43,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash 494281356, now seen corresponding path program 1 times [2018-10-26 21:08:43,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:44,263 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 21:08:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 21:08:44,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:44,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:44,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:44,484 INFO L87 Difference]: Start difference. First operand 14159 states and 16088 transitions. Second operand 5 states. [2018-10-26 21:08:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:47,593 INFO L93 Difference]: Finished difference Result 35358 states and 40264 transitions. [2018-10-26 21:08:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:47,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2018-10-26 21:08:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:47,617 INFO L225 Difference]: With dead ends: 35358 [2018-10-26 21:08:47,617 INFO L226 Difference]: Without dead ends: 20646 [2018-10-26 21:08:47,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20646 states. [2018-10-26 21:08:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20646 to 19166. [2018-10-26 21:08:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19166 states. [2018-10-26 21:08:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 21810 transitions. [2018-10-26 21:08:47,846 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 21810 transitions. Word has length 414 [2018-10-26 21:08:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:47,847 INFO L481 AbstractCegarLoop]: Abstraction has 19166 states and 21810 transitions. [2018-10-26 21:08:47,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 21810 transitions. [2018-10-26 21:08:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-26 21:08:47,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:47,871 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:47,872 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:47,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1286239209, now seen corresponding path program 1 times [2018-10-26 21:08:47,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:47,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:47,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:47,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-26 21:08:48,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:48,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:08:48,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:48,484 INFO L87 Difference]: Start difference. First operand 19166 states and 21810 transitions. Second operand 3 states. [2018-10-26 21:08:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:49,442 INFO L93 Difference]: Finished difference Result 35175 states and 40002 transitions. [2018-10-26 21:08:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:49,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-26 21:08:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:49,461 INFO L225 Difference]: With dead ends: 35175 [2018-10-26 21:08:49,461 INFO L226 Difference]: Without dead ends: 18421 [2018-10-26 21:08:49,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 21:08:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2018-10-26 21:08:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18421. [2018-10-26 21:08:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18421 states. [2018-10-26 21:08:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18421 states to 18421 states and 20880 transitions. [2018-10-26 21:08:49,670 INFO L78 Accepts]: Start accepts. Automaton has 18421 states and 20880 transitions. Word has length 440 [2018-10-26 21:08:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:49,671 INFO L481 AbstractCegarLoop]: Abstraction has 18421 states and 20880 transitions. [2018-10-26 21:08:49,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18421 states and 20880 transitions. [2018-10-26 21:08:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-26 21:08:49,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:49,690 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:08:49,690 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:49,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2047885097, now seen corresponding path program 1 times [2018-10-26 21:08:49,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-26 21:08:50,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:50,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:50,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:50,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:50,170 INFO L87 Difference]: Start difference. First operand 18421 states and 20880 transitions. Second operand 4 states. [2018-10-26 21:08:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:52,331 INFO L93 Difference]: Finished difference Result 37225 states and 42209 transitions. [2018-10-26 21:08:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:52,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-26 21:08:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:52,349 INFO L225 Difference]: With dead ends: 37225 [2018-10-26 21:08:52,349 INFO L226 Difference]: Without dead ends: 18991 [2018-10-26 21:08:52,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18991 states. [2018-10-26 21:08:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18991 to 18419. [2018-10-26 21:08:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2018-10-26 21:08:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 20442 transitions. [2018-10-26 21:08:52,530 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 20442 transitions. Word has length 505 [2018-10-26 21:08:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:52,530 INFO L481 AbstractCegarLoop]: Abstraction has 18419 states and 20442 transitions. [2018-10-26 21:08:52,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 20442 transitions. [2018-10-26 21:08:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-10-26 21:08:52,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:52,548 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-26 21:08:52,548 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:52,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1718702583, now seen corresponding path program 1 times [2018-10-26 21:08:52,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:52,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:53,209 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 21:08:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 454 proven. 111 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 21:08:54,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:54,026 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-26 21:08:54,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:54,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 348 proven. 457 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 21:08:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-26 21:08:55,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:08:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:08:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:08:55,479 INFO L87 Difference]: Start difference. First operand 18419 states and 20442 transitions. Second operand 9 states. [2018-10-26 21:09:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:04,409 INFO L93 Difference]: Finished difference Result 49532 states and 54970 transitions. [2018-10-26 21:09:04,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 21:09:04,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 576 [2018-10-26 21:09:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:04,443 INFO L225 Difference]: With dead ends: 49532 [2018-10-26 21:09:04,443 INFO L226 Difference]: Without dead ends: 30556 [2018-10-26 21:09:04,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-10-26 21:09:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-10-26 21:09:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 28049. [2018-10-26 21:09:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28049 states. [2018-10-26 21:09:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28049 states to 28049 states and 31182 transitions. [2018-10-26 21:09:04,739 INFO L78 Accepts]: Start accepts. Automaton has 28049 states and 31182 transitions. Word has length 576 [2018-10-26 21:09:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:04,740 INFO L481 AbstractCegarLoop]: Abstraction has 28049 states and 31182 transitions. [2018-10-26 21:09:04,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:09:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 28049 states and 31182 transitions. [2018-10-26 21:09:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-10-26 21:09:04,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:04,760 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 21:09:04,760 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 507591029, now seen corresponding path program 1 times [2018-10-26 21:09:04,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:04,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:04,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-10-26 21:09:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:05,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:09:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:09:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:05,361 INFO L87 Difference]: Start difference. First operand 28049 states and 31182 transitions. Second operand 3 states. [2018-10-26 21:09:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:06,624 INFO L93 Difference]: Finished difference Result 57201 states and 63569 transitions. [2018-10-26 21:09:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:09:06,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 588 [2018-10-26 21:09:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:06,649 INFO L225 Difference]: With dead ends: 57201 [2018-10-26 21:09:06,649 INFO L226 Difference]: Without dead ends: 27284 [2018-10-26 21:09:06,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2018-10-26 21:09:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 27099. [2018-10-26 21:09:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-10-26 21:09:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29577 transitions. [2018-10-26 21:09:06,906 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29577 transitions. Word has length 588 [2018-10-26 21:09:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:06,906 INFO L481 AbstractCegarLoop]: Abstraction has 27099 states and 29577 transitions. [2018-10-26 21:09:06,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:09:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29577 transitions. [2018-10-26 21:09:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-26 21:09:06,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:06,926 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 21:09:06,927 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:06,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -991108154, now seen corresponding path program 1 times [2018-10-26 21:09:06,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:07,653 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-26 21:09:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 595 proven. 368 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-10-26 21:09:08,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:08,568 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-26 21:09:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:08,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 653 proven. 24 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-10-26 21:09:09,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:09:09,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-10-26 21:09:09,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:09:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:09:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:09:09,703 INFO L87 Difference]: Start difference. First operand 27099 states and 29577 transitions. Second operand 10 states. [2018-10-26 21:09:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:14,141 INFO L93 Difference]: Finished difference Result 52820 states and 57592 transitions. [2018-10-26 21:09:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:09:14,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 596 [2018-10-26 21:09:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:14,167 INFO L225 Difference]: With dead ends: 52820 [2018-10-26 21:09:14,168 INFO L226 Difference]: Without dead ends: 27760 [2018-10-26 21:09:14,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 594 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:09:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27760 states. [2018-10-26 21:09:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27760 to 27099. [2018-10-26 21:09:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-10-26 21:09:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29571 transitions. [2018-10-26 21:09:14,459 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29571 transitions. Word has length 596 [2018-10-26 21:09:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:14,460 INFO L481 AbstractCegarLoop]: Abstraction has 27099 states and 29571 transitions. [2018-10-26 21:09:14,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:09:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29571 transitions. [2018-10-26 21:09:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-26 21:09:14,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:14,482 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-26 21:09:14,482 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:14,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1927532272, now seen corresponding path program 1 times [2018-10-26 21:09:14,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1090 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-10-26 21:09:15,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:15,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:09:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:09:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:15,611 INFO L87 Difference]: Start difference. First operand 27099 states and 29571 transitions. Second operand 5 states. [2018-10-26 21:09:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:17,798 INFO L93 Difference]: Finished difference Result 53646 states and 58631 transitions. [2018-10-26 21:09:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:09:17,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 799 [2018-10-26 21:09:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:17,824 INFO L225 Difference]: With dead ends: 53646 [2018-10-26 21:09:17,824 INFO L226 Difference]: Without dead ends: 26734 [2018-10-26 21:09:17,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26734 states. [2018-10-26 21:09:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26734 to 23763. [2018-10-26 21:09:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23763 states. [2018-10-26 21:09:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23763 states to 23763 states and 25456 transitions. [2018-10-26 21:09:18,100 INFO L78 Accepts]: Start accepts. Automaton has 23763 states and 25456 transitions. Word has length 799 [2018-10-26 21:09:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:18,101 INFO L481 AbstractCegarLoop]: Abstraction has 23763 states and 25456 transitions. [2018-10-26 21:09:18,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:09:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23763 states and 25456 transitions. [2018-10-26 21:09:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-10-26 21:09:18,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:18,124 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:09:18,125 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:18,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1966311317, now seen corresponding path program 1 times [2018-10-26 21:09:18,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:18,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:18,868 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 21:09:19,323 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-26 21:09:19,721 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-10-26 21:09:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1145 proven. 112 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-26 21:09:21,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:21,138 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:09:21,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:21,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:31,699 WARN L179 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-10-26 21:09:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1498 proven. 409 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-10-26 21:09:34,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:09:34,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-10-26 21:09:34,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:09:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:09:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=120, Unknown=1, NotChecked=0, Total=156 [2018-10-26 21:09:34,550 INFO L87 Difference]: Start difference. First operand 23763 states and 25456 transitions. Second operand 13 states. Received shutdown request... [2018-10-26 21:11:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:11:59,592 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:11:59,597 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:11:59,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:11:59 BoogieIcfgContainer [2018-10-26 21:11:59,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:11:59,598 INFO L168 Benchmark]: Toolchain (without parser) took 246219.26 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 717.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:11:59,599 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:11:59,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:11:59,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 278.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-26 21:11:59,601 INFO L168 Benchmark]: Boogie Preprocessor took 185.06 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:11:59,602 INFO L168 Benchmark]: RCFGBuilder took 4523.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 185.1 MB). Peak memory consumption was 185.1 MB. Max. memory is 7.1 GB. [2018-10-26 21:11:59,602 INFO L168 Benchmark]: TraceAbstraction took 240338.71 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 549.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:11:59,607 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 278.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 185.06 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4523.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 185.1 MB). Peak memory consumption was 185.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240338.71 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 549.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 189]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 189). Cancelled while BasicCegarLoop was constructing difference of abstraction (23763states) and FLOYD_HOARE automaton (currently 3 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 240.2s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 206.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3960 SDtfs, 8939 SDslu, 1828 SDs, 0 SdLazy, 21930 SolverSat, 4338 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 194.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2543 GetRequests, 2458 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28049occurred in iteration=14, 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: 2.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 17378 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 9846 NumberOfCodeBlocks, 9846 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9824 ConstructedInterpolants, 452 QuantifiedInterpolants, 32133013 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3145 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 15687/17374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown