java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:37:26,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:37:26,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:37:26,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:37:26,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:37:26,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:37:26,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:37:26,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:37:26,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:37:26,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:37:26,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:37:26,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:37:26,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:37:26,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:37:26,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:37:26,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:37:26,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:37:26,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:37:26,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:37:26,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:37:26,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:37:26,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:37:26,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:37:26,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:37:26,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:37:26,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:37:26,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:37:26,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:37:26,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:37:26,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:37:26,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:37:26,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:37:26,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:37:26,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:37:26,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:37:26,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:37:26,400 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:37:26,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:37:26,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:37:26,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:37:26,423 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:37:26,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:37:26,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:37:26,424 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:37:26,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:37:26,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:37:26,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:37:26,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:37:26,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:37:26,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:37:26,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:37:26,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:37:26,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:37:26,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:37:26,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:37:26,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:37:26,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:37:26,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:37:26,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:37:26,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:37:26,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:37:26,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:37:26,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:37:26,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:37:26,430 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:37:26,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:37:26,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:37:26,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:37:26,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:37:26,499 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:37:26,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-10-26 21:37:26,559 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66de542e6/59cdcf60a4494ffc839d928136171452/FLAG763abd570 [2018-10-26 21:37:27,248 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:37:27,249 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-10-26 21:37:27,271 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66de542e6/59cdcf60a4494ffc839d928136171452/FLAG763abd570 [2018-10-26 21:37:27,293 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66de542e6/59cdcf60a4494ffc839d928136171452 [2018-10-26 21:37:27,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:37:27,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:37:27,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:37:27,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:37:27,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:37:27,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:37:27" (1/1) ... [2018-10-26 21:37:27,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b5a5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:27, skipping insertion in model container [2018-10-26 21:37:27,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:37:27" (1/1) ... [2018-10-26 21:37:27,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:37:27,414 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:37:28,198 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:37:28,211 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:37:28,523 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:37:28,543 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:37:28,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28 WrapperNode [2018-10-26 21:37:28,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:37:28,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:37:28,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:37:28,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:37:28,554 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:37:28" (1/1) ... [2018-10-26 21:37:28,597 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:37:28" (1/1) ... [2018-10-26 21:37:28,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:37:28,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:37:28,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:37:28,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:37:28,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:28,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:28,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:28,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:29,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:29,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:29,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (1/1) ... [2018-10-26 21:37:29,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:37:29,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:37:29,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:37:29,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:37:29,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (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:37:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:37:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:37:29,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:37:37,117 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:37:37,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:37:37 BoogieIcfgContainer [2018-10-26 21:37:37,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:37:37,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:37:37,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:37:37,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:37:37,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:37:27" (1/3) ... [2018-10-26 21:37:37,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17895e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:37:37, skipping insertion in model container [2018-10-26 21:37:37,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:37:28" (2/3) ... [2018-10-26 21:37:37,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17895e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:37:37, skipping insertion in model container [2018-10-26 21:37:37,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:37:37" (3/3) ... [2018-10-26 21:37:37,126 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label16_true-unreach-call.c [2018-10-26 21:37:37,136 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:37:37,145 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:37:37,163 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:37:37,205 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:37:37,205 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:37:37,206 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:37:37,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:37:37,206 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:37:37,206 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:37:37,206 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:37:37,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:37:37,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:37:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-26 21:37:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 21:37:37,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:37:37,247 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:37:37,250 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:37:37,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:37:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 265969354, now seen corresponding path program 1 times [2018-10-26 21:37:37,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:37:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:37:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:37:37,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:37:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:37:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:37:37,814 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 21:37:37,834 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:37:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:37:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:37:37,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:37:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:37:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:37:37,861 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-26 21:37:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:37:46,709 INFO L93 Difference]: Finished difference Result 1474 states and 2723 transitions. [2018-10-26 21:37:46,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:37:46,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-10-26 21:37:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:37:46,742 INFO L225 Difference]: With dead ends: 1474 [2018-10-26 21:37:46,742 INFO L226 Difference]: Without dead ends: 1042 [2018-10-26 21:37:46,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:37:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-10-26 21:37:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2018-10-26 21:37:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-10-26 21:37:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1638 transitions. [2018-10-26 21:37:46,889 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1638 transitions. Word has length 63 [2018-10-26 21:37:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:37:46,890 INFO L481 AbstractCegarLoop]: Abstraction has 1040 states and 1638 transitions. [2018-10-26 21:37:46,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:37:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1638 transitions. [2018-10-26 21:37:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 21:37:46,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:37:46,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:37:46,897 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:37:46,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:37:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -899294482, now seen corresponding path program 1 times [2018-10-26 21:37:46,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:37:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:37:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:37:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:37:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:37:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:37:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:37:47,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:37:47,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:37:47,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:37:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:37:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:37:47,341 INFO L87 Difference]: Start difference. First operand 1040 states and 1638 transitions. Second operand 5 states. [2018-10-26 21:38:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:03,891 INFO L93 Difference]: Finished difference Result 3299 states and 5135 transitions. [2018-10-26 21:38:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:03,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-26 21:38:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:03,907 INFO L225 Difference]: With dead ends: 3299 [2018-10-26 21:38:03,907 INFO L226 Difference]: Without dead ends: 2261 [2018-10-26 21:38:03,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:38:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-10-26 21:38:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1953. [2018-10-26 21:38:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2018-10-26 21:38:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2816 transitions. [2018-10-26 21:38:03,976 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2816 transitions. Word has length 129 [2018-10-26 21:38:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:03,976 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 2816 transitions. [2018-10-26 21:38:03,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:38:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2816 transitions. [2018-10-26 21:38:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 21:38:03,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:03,980 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:38:03,980 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:03,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183744, now seen corresponding path program 1 times [2018-10-26 21:38:03,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:03,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:03,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:04,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:38:04,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:38:04,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:38:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:38:04,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:04,319 INFO L87 Difference]: Start difference. First operand 1953 states and 2816 transitions. Second operand 4 states. [2018-10-26 21:38:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:09,923 INFO L93 Difference]: Finished difference Result 7212 states and 10585 transitions. [2018-10-26 21:38:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:09,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-10-26 21:38:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:09,952 INFO L225 Difference]: With dead ends: 7212 [2018-10-26 21:38:09,953 INFO L226 Difference]: Without dead ends: 5261 [2018-10-26 21:38:09,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2018-10-26 21:38:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5255. [2018-10-26 21:38:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5255 states. [2018-10-26 21:38:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 6986 transitions. [2018-10-26 21:38:10,063 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 6986 transitions. Word has length 134 [2018-10-26 21:38:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:10,064 INFO L481 AbstractCegarLoop]: Abstraction has 5255 states and 6986 transitions. [2018-10-26 21:38:10,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:38:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 6986 transitions. [2018-10-26 21:38:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 21:38:10,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:10,069 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:38:10,069 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:10,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -648643925, now seen corresponding path program 1 times [2018-10-26 21:38:10,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:10,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 21:38:10,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:38:10,507 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:38:10,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:10,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:38:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:10,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:38:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 21:38:10,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:38:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:38:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:10,768 INFO L87 Difference]: Start difference. First operand 5255 states and 6986 transitions. Second operand 4 states. [2018-10-26 21:38:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:17,315 INFO L93 Difference]: Finished difference Result 19280 states and 26028 transitions. [2018-10-26 21:38:17,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:17,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2018-10-26 21:38:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:17,379 INFO L225 Difference]: With dead ends: 19280 [2018-10-26 21:38:17,379 INFO L226 Difference]: Without dead ends: 14027 [2018-10-26 21:38:17,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 235 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:38:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14027 states. [2018-10-26 21:38:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14027 to 8857. [2018-10-26 21:38:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2018-10-26 21:38:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 11192 transitions. [2018-10-26 21:38:17,583 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 11192 transitions. Word has length 235 [2018-10-26 21:38:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:17,583 INFO L481 AbstractCegarLoop]: Abstraction has 8857 states and 11192 transitions. [2018-10-26 21:38:17,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:38:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 11192 transitions. [2018-10-26 21:38:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 21:38:17,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:17,593 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,593 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:17,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash -845032929, now seen corresponding path program 1 times [2018-10-26 21:38:17,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:17,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:17,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:17,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:17,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:18,244 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-26 21:38:18,571 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-26 21:38:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-26 21:38:18,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:38:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:38:18,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:38:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:38:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:38:18,935 INFO L87 Difference]: Start difference. First operand 8857 states and 11192 transitions. Second operand 5 states. [2018-10-26 21:38:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:27,407 INFO L93 Difference]: Finished difference Result 19215 states and 24057 transitions. [2018-10-26 21:38:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:27,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 337 [2018-10-26 21:38:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:27,448 INFO L225 Difference]: With dead ends: 19215 [2018-10-26 21:38:27,448 INFO L226 Difference]: Without dead ends: 10360 [2018-10-26 21:38:27,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:38:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10360 states. [2018-10-26 21:38:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10360 to 10057. [2018-10-26 21:38:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2018-10-26 21:38:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 12448 transitions. [2018-10-26 21:38:27,629 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 12448 transitions. Word has length 337 [2018-10-26 21:38:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:27,630 INFO L481 AbstractCegarLoop]: Abstraction has 10057 states and 12448 transitions. [2018-10-26 21:38:27,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:38:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 12448 transitions. [2018-10-26 21:38:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-26 21:38:27,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:27,644 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,644 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:27,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash -506042351, now seen corresponding path program 1 times [2018-10-26 21:38:27,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:27,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:27,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 21:38:28,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:38:28,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:38:28,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:38:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:38:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:28,072 INFO L87 Difference]: Start difference. First operand 10057 states and 12448 transitions. Second operand 4 states. [2018-10-26 21:38:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:32,860 INFO L93 Difference]: Finished difference Result 25814 states and 32434 transitions. [2018-10-26 21:38:32,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:32,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-10-26 21:38:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:32,889 INFO L225 Difference]: With dead ends: 25814 [2018-10-26 21:38:32,890 INFO L226 Difference]: Without dead ends: 15759 [2018-10-26 21:38:32,903 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:38:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2018-10-26 21:38:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 15759. [2018-10-26 21:38:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15759 states. [2018-10-26 21:38:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15759 states to 15759 states and 18917 transitions. [2018-10-26 21:38:33,141 INFO L78 Accepts]: Start accepts. Automaton has 15759 states and 18917 transitions. Word has length 411 [2018-10-26 21:38:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:33,142 INFO L481 AbstractCegarLoop]: Abstraction has 15759 states and 18917 transitions. [2018-10-26 21:38:33,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:38:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15759 states and 18917 transitions. [2018-10-26 21:38:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-26 21:38:33,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:33,162 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,162 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:33,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2057211809, now seen corresponding path program 1 times [2018-10-26 21:38:33,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:33,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-26 21:38:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:38:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:38:33,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:38:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:38:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:33,944 INFO L87 Difference]: Start difference. First operand 15759 states and 18917 transitions. Second operand 4 states. [2018-10-26 21:38:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:39,259 INFO L93 Difference]: Finished difference Result 31518 states and 37839 transitions. [2018-10-26 21:38:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:38:39,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2018-10-26 21:38:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:39,294 INFO L225 Difference]: With dead ends: 31518 [2018-10-26 21:38:39,294 INFO L226 Difference]: Without dead ends: 15761 [2018-10-26 21:38:39,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:38:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15761 states. [2018-10-26 21:38:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15761 to 15757. [2018-10-26 21:38:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15757 states. [2018-10-26 21:38:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 18094 transitions. [2018-10-26 21:38:39,501 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 18094 transitions. Word has length 496 [2018-10-26 21:38:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:39,502 INFO L481 AbstractCegarLoop]: Abstraction has 15757 states and 18094 transitions. [2018-10-26 21:38:39,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:38:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 18094 transitions. [2018-10-26 21:38:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-26 21:38:39,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:39,522 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:38:39,522 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1720017519, now seen corresponding path program 1 times [2018-10-26 21:38:39,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:39,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 542 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-10-26 21:38:40,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:38:40,895 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:38:40,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:41,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:38:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-26 21:38:41,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:38:41,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 21:38:41,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:38:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:38:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:38:41,225 INFO L87 Difference]: Start difference. First operand 15757 states and 18094 transitions. Second operand 8 states. [2018-10-26 21:38:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:38:51,672 INFO L93 Difference]: Finished difference Result 35882 states and 40871 transitions. [2018-10-26 21:38:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:38:51,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 520 [2018-10-26 21:38:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:38:51,698 INFO L225 Difference]: With dead ends: 35882 [2018-10-26 21:38:51,698 INFO L226 Difference]: Without dead ends: 16052 [2018-10-26 21:38:51,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:38:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16052 states. [2018-10-26 21:38:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16052 to 15752. [2018-10-26 21:38:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-10-26 21:38:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 17369 transitions. [2018-10-26 21:38:51,915 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 17369 transitions. Word has length 520 [2018-10-26 21:38:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:38:51,916 INFO L481 AbstractCegarLoop]: Abstraction has 15752 states and 17369 transitions. [2018-10-26 21:38:51,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:38:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 17369 transitions. [2018-10-26 21:38:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-10-26 21:38:51,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:38:51,931 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,932 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:38:51,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1798089204, now seen corresponding path program 1 times [2018-10-26 21:38:51,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:38:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:38:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:38:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:52,516 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:38:52,704 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-26 21:38:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 271 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:38:53,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:38:53,222 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:38:53,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:38:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:53,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:38:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 21:38:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:38:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-26 21:38:53,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:38:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:38:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:38:53,764 INFO L87 Difference]: Start difference. First operand 15752 states and 17369 transitions. Second operand 9 states. [2018-10-26 21:39:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:03,069 INFO L93 Difference]: Finished difference Result 31968 states and 35207 transitions. [2018-10-26 21:39:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:39:03,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 521 [2018-10-26 21:39:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:03,089 INFO L225 Difference]: With dead ends: 31968 [2018-10-26 21:39:03,089 INFO L226 Difference]: Without dead ends: 16218 [2018-10-26 21:39:03,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 525 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:39:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16218 states. [2018-10-26 21:39:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16218 to 15748. [2018-10-26 21:39:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15748 states. [2018-10-26 21:39:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15748 states to 15748 states and 16802 transitions. [2018-10-26 21:39:03,287 INFO L78 Accepts]: Start accepts. Automaton has 15748 states and 16802 transitions. Word has length 521 [2018-10-26 21:39:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:03,288 INFO L481 AbstractCegarLoop]: Abstraction has 15748 states and 16802 transitions. [2018-10-26 21:39:03,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:39:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15748 states and 16802 transitions. [2018-10-26 21:39:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-26 21:39:03,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:03,307 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:39:03,307 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:03,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:03,308 INFO L82 PathProgramCache]: Analyzing trace with hash 191164642, now seen corresponding path program 1 times [2018-10-26 21:39:03,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:03,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:03,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-26 21:39:03,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:03,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:03,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:03,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:03,767 INFO L87 Difference]: Start difference. First operand 15748 states and 16802 transitions. Second operand 3 states. [2018-10-26 21:39:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:06,662 INFO L93 Difference]: Finished difference Result 31792 states and 33962 transitions. [2018-10-26 21:39:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:06,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2018-10-26 21:39:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:06,676 INFO L225 Difference]: With dead ends: 31792 [2018-10-26 21:39:06,677 INFO L226 Difference]: Without dead ends: 16046 [2018-10-26 21:39:06,686 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:39:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16046 states. [2018-10-26 21:39:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16046 to 15746. [2018-10-26 21:39:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15746 states. [2018-10-26 21:39:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15746 states to 15746 states and 16798 transitions. [2018-10-26 21:39:06,864 INFO L78 Accepts]: Start accepts. Automaton has 15746 states and 16798 transitions. Word has length 567 [2018-10-26 21:39:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:06,865 INFO L481 AbstractCegarLoop]: Abstraction has 15746 states and 16798 transitions. [2018-10-26 21:39:06,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15746 states and 16798 transitions. [2018-10-26 21:39:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-10-26 21:39:06,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:06,880 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:39:06,880 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:06,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1070353790, now seen corresponding path program 1 times [2018-10-26 21:39:06,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-10-26 21:39:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:07,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:07,478 INFO L87 Difference]: Start difference. First operand 15746 states and 16798 transitions. Second operand 3 states. [2018-10-26 21:39:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:10,158 INFO L93 Difference]: Finished difference Result 37802 states and 40568 transitions. [2018-10-26 21:39:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:10,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2018-10-26 21:39:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:10,184 INFO L225 Difference]: With dead ends: 37802 [2018-10-26 21:39:10,184 INFO L226 Difference]: Without dead ends: 22058 [2018-10-26 21:39:10,196 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:39:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22058 states. [2018-10-26 21:39:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22058 to 22048. [2018-10-26 21:39:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2018-10-26 21:39:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 23453 transitions. [2018-10-26 21:39:10,443 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 23453 transitions. Word has length 645 [2018-10-26 21:39:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:10,444 INFO L481 AbstractCegarLoop]: Abstraction has 22048 states and 23453 transitions. [2018-10-26 21:39:10,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 23453 transitions. [2018-10-26 21:39:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-10-26 21:39:10,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:10,465 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:39:10,465 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:10,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -684261465, now seen corresponding path program 1 times [2018-10-26 21:39:10,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:10,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:10,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2018-10-26 21:39:11,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:11,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:39:11,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:39:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:39:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:39:11,388 INFO L87 Difference]: Start difference. First operand 22048 states and 23453 transitions. Second operand 5 states. [2018-10-26 21:39:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:16,343 INFO L93 Difference]: Finished difference Result 58815 states and 62612 transitions. [2018-10-26 21:39:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:39:16,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 691 [2018-10-26 21:39:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:16,379 INFO L225 Difference]: With dead ends: 58815 [2018-10-26 21:39:16,379 INFO L226 Difference]: Without dead ends: 36769 [2018-10-26 21:39:16,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:39:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36769 states. [2018-10-26 21:39:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36769 to 28645. [2018-10-26 21:39:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28645 states. [2018-10-26 21:39:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28645 states to 28645 states and 30252 transitions. [2018-10-26 21:39:16,692 INFO L78 Accepts]: Start accepts. Automaton has 28645 states and 30252 transitions. Word has length 691 [2018-10-26 21:39:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:16,693 INFO L481 AbstractCegarLoop]: Abstraction has 28645 states and 30252 transitions. [2018-10-26 21:39:16,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:39:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 28645 states and 30252 transitions. [2018-10-26 21:39:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-10-26 21:39:16,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:16,714 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:39:16,714 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:16,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash 778946677, now seen corresponding path program 1 times [2018-10-26 21:39:16,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:16,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-26 21:39:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:17,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:17,295 INFO L87 Difference]: Start difference. First operand 28645 states and 30252 transitions. Second operand 3 states. [2018-10-26 21:39:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:20,537 INFO L93 Difference]: Finished difference Result 59687 states and 63192 transitions. [2018-10-26 21:39:20,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:20,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 696 [2018-10-26 21:39:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:20,562 INFO L225 Difference]: With dead ends: 59687 [2018-10-26 21:39:20,562 INFO L226 Difference]: Without dead ends: 31044 [2018-10-26 21:39:20,575 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:39:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31044 states. [2018-10-26 21:39:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31044 to 31044. [2018-10-26 21:39:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31044 states. [2018-10-26 21:39:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31044 states to 31044 states and 32565 transitions. [2018-10-26 21:39:20,795 INFO L78 Accepts]: Start accepts. Automaton has 31044 states and 32565 transitions. Word has length 696 [2018-10-26 21:39:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:20,796 INFO L481 AbstractCegarLoop]: Abstraction has 31044 states and 32565 transitions. [2018-10-26 21:39:20,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 31044 states and 32565 transitions. [2018-10-26 21:39:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-26 21:39:20,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:20,813 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, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,814 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:20,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1922978813, now seen corresponding path program 1 times [2018-10-26 21:39:20,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:20,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-10-26 21:39:21,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:21,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:21,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:21,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:21,550 INFO L87 Difference]: Start difference. First operand 31044 states and 32565 transitions. Second operand 3 states. [2018-10-26 21:39:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:23,698 INFO L93 Difference]: Finished difference Result 56339 states and 59052 transitions. [2018-10-26 21:39:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:23,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2018-10-26 21:39:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:23,714 INFO L225 Difference]: With dead ends: 56339 [2018-10-26 21:39:23,714 INFO L226 Difference]: Without dead ends: 16562 [2018-10-26 21:39:23,730 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:39:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16562 states. [2018-10-26 21:39:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16562 to 13862. [2018-10-26 21:39:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13862 states. [2018-10-26 21:39:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13862 states to 13862 states and 14243 transitions. [2018-10-26 21:39:23,854 INFO L78 Accepts]: Start accepts. Automaton has 13862 states and 14243 transitions. Word has length 758 [2018-10-26 21:39:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:23,854 INFO L481 AbstractCegarLoop]: Abstraction has 13862 states and 14243 transitions. [2018-10-26 21:39:23,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13862 states and 14243 transitions. [2018-10-26 21:39:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2018-10-26 21:39:23,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:23,863 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,864 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:23,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash -562456670, now seen corresponding path program 1 times [2018-10-26 21:39:23,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:23,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2018-10-26 21:39:25,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:25,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:25,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:25,073 INFO L87 Difference]: Start difference. First operand 13862 states and 14243 transitions. Second operand 3 states. [2018-10-26 21:39:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:26,551 INFO L93 Difference]: Finished difference Result 30428 states and 31275 transitions. [2018-10-26 21:39:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:26,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 813 [2018-10-26 21:39:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:26,569 INFO L225 Difference]: With dead ends: 30428 [2018-10-26 21:39:26,569 INFO L226 Difference]: Without dead ends: 16567 [2018-10-26 21:39:26,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16567 states. [2018-10-26 21:39:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16567 to 15361. [2018-10-26 21:39:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15361 states. [2018-10-26 21:39:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15361 states to 15361 states and 15758 transitions. [2018-10-26 21:39:26,723 INFO L78 Accepts]: Start accepts. Automaton has 15361 states and 15758 transitions. Word has length 813 [2018-10-26 21:39:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:26,724 INFO L481 AbstractCegarLoop]: Abstraction has 15361 states and 15758 transitions. [2018-10-26 21:39:26,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15361 states and 15758 transitions. [2018-10-26 21:39:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-10-26 21:39:26,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:26,735 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:39:26,735 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:26,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1363917183, now seen corresponding path program 1 times [2018-10-26 21:39:26,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 682 proven. 56 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-26 21:39:27,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:39:27,860 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:39:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:28,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:39:28,326 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2018-10-26 21:39:29,044 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-26 21:39:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 684 proven. 54 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-26 21:39:30,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:39:30,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 21:39:30,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:39:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:39:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:39:30,534 INFO L87 Difference]: Start difference. First operand 15361 states and 15758 transitions. Second operand 8 states. [2018-10-26 21:39:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:46,022 INFO L93 Difference]: Finished difference Result 39758 states and 40858 transitions. [2018-10-26 21:39:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:39:46,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 832 [2018-10-26 21:39:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:46,046 INFO L225 Difference]: With dead ends: 39758 [2018-10-26 21:39:46,046 INFO L226 Difference]: Without dead ends: 23490 [2018-10-26 21:39:46,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:39:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2018-10-26 21:39:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 15657. [2018-10-26 21:39:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15657 states. [2018-10-26 21:39:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 16050 transitions. [2018-10-26 21:39:46,224 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 16050 transitions. Word has length 832 [2018-10-26 21:39:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:46,224 INFO L481 AbstractCegarLoop]: Abstraction has 15657 states and 16050 transitions. [2018-10-26 21:39:46,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:39:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 16050 transitions. [2018-10-26 21:39:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-10-26 21:39:46,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:46,235 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:39:46,236 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:46,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 51617314, now seen corresponding path program 1 times [2018-10-26 21:39:46,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:46,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:46,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:46,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:46,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:46,708 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-26 21:39:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-26 21:39:47,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:39:47,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:39:47,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:39:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:39:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:39:47,006 INFO L87 Difference]: Start difference. First operand 15657 states and 16050 transitions. Second operand 3 states. [2018-10-26 21:39:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:39:48,490 INFO L93 Difference]: Finished difference Result 32216 states and 33040 transitions. [2018-10-26 21:39:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:39:48,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2018-10-26 21:39:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:39:48,506 INFO L225 Difference]: With dead ends: 32216 [2018-10-26 21:39:48,506 INFO L226 Difference]: Without dead ends: 16861 [2018-10-26 21:39:48,514 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:39:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16861 states. [2018-10-26 21:39:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16861 to 15354. [2018-10-26 21:39:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2018-10-26 21:39:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 15717 transitions. [2018-10-26 21:39:48,668 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 15717 transitions. Word has length 841 [2018-10-26 21:39:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:39:48,669 INFO L481 AbstractCegarLoop]: Abstraction has 15354 states and 15717 transitions. [2018-10-26 21:39:48,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:39:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 15717 transitions. [2018-10-26 21:39:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2018-10-26 21:39:48,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:39:48,688 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:48,688 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:39:48,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:39:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1597390021, now seen corresponding path program 1 times [2018-10-26 21:39:48,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:39:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:39:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:48,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:39:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 562 proven. 399 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-10-26 21:39:50,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:39:50,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:39:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:39:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:50,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:39:50,882 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2018-10-26 21:39:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 834 proven. 188 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 21:39:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:39:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-10-26 21:39:51,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:39:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:39:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:39:51,942 INFO L87 Difference]: Start difference. First operand 15354 states and 15717 transitions. Second operand 10 states. [2018-10-26 21:40:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:40:11,414 INFO L93 Difference]: Finished difference Result 41245 states and 42245 transitions. [2018-10-26 21:40:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 21:40:11,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 854 [2018-10-26 21:40:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:40:11,439 INFO L225 Difference]: With dead ends: 41245 [2018-10-26 21:40:11,439 INFO L226 Difference]: Without dead ends: 25886 [2018-10-26 21:40:11,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 21:40:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25886 states. [2018-10-26 21:40:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25886 to 15350. [2018-10-26 21:40:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15350 states. [2018-10-26 21:40:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15350 states to 15350 states and 15632 transitions. [2018-10-26 21:40:11,632 INFO L78 Accepts]: Start accepts. Automaton has 15350 states and 15632 transitions. Word has length 854 [2018-10-26 21:40:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:40:11,632 INFO L481 AbstractCegarLoop]: Abstraction has 15350 states and 15632 transitions. [2018-10-26 21:40:11,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:40:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 15350 states and 15632 transitions. [2018-10-26 21:40:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2018-10-26 21:40:11,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:40:11,646 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:40:11,647 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:40:11,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:40:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1666864483, now seen corresponding path program 1 times [2018-10-26 21:40:11,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:40:11,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:40:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:40:11,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:40:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:40:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 80 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-26 21:40:12,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:40:12,608 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:40:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:40:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:12,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:40:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 77 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-26 21:40:13,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:40:13,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-10-26 21:40:13,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:40:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:40:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:40:13,735 INFO L87 Difference]: Start difference. First operand 15350 states and 15632 transitions. Second operand 11 states. [2018-10-26 21:40:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:40:23,776 INFO L93 Difference]: Finished difference Result 31607 states and 32193 transitions. [2018-10-26 21:40:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:40:23,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 911 [2018-10-26 21:40:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:40:23,794 INFO L225 Difference]: With dead ends: 31607 [2018-10-26 21:40:23,794 INFO L226 Difference]: Without dead ends: 18059 [2018-10-26 21:40:23,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 916 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:40:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2018-10-26 21:40:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 15650. [2018-10-26 21:40:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2018-10-26 21:40:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 15900 transitions. [2018-10-26 21:40:23,971 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 15900 transitions. Word has length 911 [2018-10-26 21:40:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:40:23,971 INFO L481 AbstractCegarLoop]: Abstraction has 15650 states and 15900 transitions. [2018-10-26 21:40:23,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:40:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 15900 transitions. [2018-10-26 21:40:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2018-10-26 21:40:23,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:40:23,987 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, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:40:23,987 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:40:23,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:40:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1766446063, now seen corresponding path program 1 times [2018-10-26 21:40:23,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:40:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:40:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:40:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:40:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:40:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:24,683 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 21:40:24,874 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 21:40:25,313 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-10-26 21:40:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 999 proven. 135 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-26 21:40:27,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:40:27,325 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:40:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:40:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:27,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:40:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 927 proven. 207 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-26 21:40:31,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:40:31,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2018-10-26 21:40:31,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 21:40:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 21:40:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2018-10-26 21:40:31,634 INFO L87 Difference]: Start difference. First operand 15650 states and 15900 transitions. Second operand 18 states. Received shutdown request... [2018-10-26 21:41:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 21:41:25,102 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:41:25,108 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:41:25,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:41:25 BoogieIcfgContainer [2018-10-26 21:41:25,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:41:25,110 INFO L168 Benchmark]: Toolchain (without parser) took 237806.55 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,113 INFO L168 Benchmark]: CDTParser took 0.24 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:41:25,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1239.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 379.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,115 INFO L168 Benchmark]: Boogie Preprocessor took 228.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,117 INFO L168 Benchmark]: RCFGBuilder took 7964.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 295.8 MB). Peak memory consumption was 295.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,117 INFO L168 Benchmark]: TraceAbstraction took 227990.09 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -305.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-26 21:41:25,122 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.24 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 1239.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 379.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 228.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7964.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 295.8 MB). Peak memory consumption was 295.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227990.09 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -305.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 193). Cancelled while BasicCegarLoop was constructing difference of abstraction (15650states) and FLOYD_HOARE automaton (currently 26 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3574 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 227.9s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 193.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5841 SDtfs, 29117 SDslu, 3341 SDs, 0 SdLazy, 69811 SolverSat, 6853 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 172.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5018 GetRequests, 4860 SyntacticMatches, 21 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31044occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 41188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 16161 NumberOfCodeBlocks, 16161 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16134 ConstructedInterpolants, 638 QuantifiedInterpolants, 46180833 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5683 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 19614/20954 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown