java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:11:02,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:11:02,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:11:02,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:11:02,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:11:02,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:11:02,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:11:02,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:11:02,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:11:02,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:11:02,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:11:02,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:11:02,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:11:02,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:11:02,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:11:02,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:11:02,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:11:02,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:11:02,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:11:02,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:11:02,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:11:02,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:11:02,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:11:02,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:11:02,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:11:02,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:11:02,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:11:02,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:11:02,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:11:02,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:11:02,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:11:02,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:11:02,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:11:02,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:11:02,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:11:02,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:11:02,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:11:02,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:11:02,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:11:02,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:11:02,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:11:02,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:11:02,458 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:11:02,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:11:02,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:11:02,459 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:11:02,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:11:02,460 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:11:02,460 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:11:02,461 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:11:02,461 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:11:02,461 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:11:02,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:11:02,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:11:02,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:11:02,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:11:02,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:11:02,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:11:02,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:11:02,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:11:02,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:11:02,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:11:02,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:11:02,465 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:11:02,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:11:02,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:11:02,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:11:02,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:11:02,467 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:11:02,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:11:02,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:11:02,467 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:11:02,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:11:02,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:11:02,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:11:02,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:11:02,541 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:11:02,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:11:02,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4514c65/915ca87a2362408e85107660bb3ef3ff/FLAGb5b1c5dc3 [2019-09-10 06:11:03,118 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:11:03,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:11:03,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4514c65/915ca87a2362408e85107660bb3ef3ff/FLAGb5b1c5dc3 [2019-09-10 06:11:03,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4514c65/915ca87a2362408e85107660bb3ef3ff [2019-09-10 06:11:03,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:11:03,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:11:03,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:11:03,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:11:03,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:11:03,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:11:03" (1/1) ... [2019-09-10 06:11:03,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:03, skipping insertion in model container [2019-09-10 06:11:03,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:11:03" (1/1) ... [2019-09-10 06:11:03,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:11:03,549 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:11:04,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:11:04,031 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:11:04,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:11:04,151 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:11:04,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04 WrapperNode [2019-09-10 06:11:04,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:11:04,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:11:04,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:11:04,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:11:04,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... [2019-09-10 06:11:04,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:11:04,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:11:04,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:11:04,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:11:04,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-10 06:11:04,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:11:04,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:11:04,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:11:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:11:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:11:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:11:04,273 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:11:04,273 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:11:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:11:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:11:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:11:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:11:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:11:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:11:05,143 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:11:05,145 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:11:05,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:11:05 BoogieIcfgContainer [2019-09-10 06:11:05,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:11:05,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:11:05,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:11:05,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:11:05,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:11:03" (1/3) ... [2019-09-10 06:11:05,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a58dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:11:05, skipping insertion in model container [2019-09-10 06:11:05,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:04" (2/3) ... [2019-09-10 06:11:05,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a58dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:11:05, skipping insertion in model container [2019-09-10 06:11:05,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:11:05" (3/3) ... [2019-09-10 06:11:05,161 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:11:05,172 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:11:05,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:11:05,211 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:11:05,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:11:05,243 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:11:05,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:11:05,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:11:05,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:11:05,244 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:11:05,245 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:11:05,245 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:11:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-10 06:11:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:11:05,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:05,291 INFO L399 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] [2019-09-10 06:11:05,293 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-10 06:11:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:05,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:05,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:05,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:05,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:05,801 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-10 06:11:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:05,933 INFO L93 Difference]: Finished difference Result 223 states and 367 transitions. [2019-09-10 06:11:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:05,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:11:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:05,950 INFO L225 Difference]: With dead ends: 223 [2019-09-10 06:11:05,950 INFO L226 Difference]: Without dead ends: 215 [2019-09-10 06:11:05,952 INFO L628 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 [2019-09-10 06:11:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-10 06:11:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-10 06:11:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 06:11:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-10 06:11:06,011 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-10 06:11:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-10 06:11:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-10 06:11:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:11:06,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:06,018 INFO L399 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] [2019-09-10 06:11:06,018 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-10 06:11:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:06,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:06,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:06,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:06,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:06,149 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-10 06:11:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:06,194 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2019-09-10 06:11:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:06,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:11:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:06,198 INFO L225 Difference]: With dead ends: 352 [2019-09-10 06:11:06,198 INFO L226 Difference]: Without dead ends: 352 [2019-09-10 06:11:06,199 INFO L628 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 [2019-09-10 06:11:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-10 06:11:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-10 06:11:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 06:11:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-10 06:11:06,224 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-10 06:11:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:06,225 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-10 06:11:06,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-10 06:11:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:11:06,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:06,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:06,228 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-10 06:11:06,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:06,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:06,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:06,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:06,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:06,383 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-10 06:11:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:06,425 INFO L93 Difference]: Finished difference Result 610 states and 970 transitions. [2019-09-10 06:11:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:06,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:11:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:06,433 INFO L225 Difference]: With dead ends: 610 [2019-09-10 06:11:06,433 INFO L226 Difference]: Without dead ends: 610 [2019-09-10 06:11:06,434 INFO L628 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 [2019-09-10 06:11:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-10 06:11:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-10 06:11:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 06:11:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-10 06:11:06,488 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-10 06:11:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:06,489 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-10 06:11:06,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-10 06:11:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:11:06,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:06,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:06,494 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-10 06:11:06,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:06,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:06,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:06,697 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-10 06:11:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:06,823 INFO L93 Difference]: Finished difference Result 1470 states and 2390 transitions. [2019-09-10 06:11:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:06,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:11:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:06,833 INFO L225 Difference]: With dead ends: 1470 [2019-09-10 06:11:06,833 INFO L226 Difference]: Without dead ends: 1470 [2019-09-10 06:11:06,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-10 06:11:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1310. [2019-09-10 06:11:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-09-10 06:11:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2125 transitions. [2019-09-10 06:11:06,874 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2125 transitions. Word has length 66 [2019-09-10 06:11:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:06,875 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 2125 transitions. [2019-09-10 06:11:06,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2125 transitions. [2019-09-10 06:11:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:11:06,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:06,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:06,879 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-10 06:11:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:06,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:07,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:07,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:11:07,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:07,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:11:07,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:11:07,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:11:07,042 INFO L87 Difference]: Start difference. First operand 1310 states and 2125 transitions. Second operand 6 states. [2019-09-10 06:11:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:07,271 INFO L93 Difference]: Finished difference Result 3898 states and 6321 transitions. [2019-09-10 06:11:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:11:07,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:11:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:07,296 INFO L225 Difference]: With dead ends: 3898 [2019-09-10 06:11:07,296 INFO L226 Difference]: Without dead ends: 3898 [2019-09-10 06:11:07,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2019-09-10 06:11:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3803. [2019-09-10 06:11:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3803 states. [2019-09-10 06:11:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 6190 transitions. [2019-09-10 06:11:07,420 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 6190 transitions. Word has length 67 [2019-09-10 06:11:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:07,421 INFO L475 AbstractCegarLoop]: Abstraction has 3803 states and 6190 transitions. [2019-09-10 06:11:07,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:11:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 6190 transitions. [2019-09-10 06:11:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:11:07,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:07,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:07,425 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-10 06:11:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:07,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:07,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:07,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:07,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:07,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:07,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:07,525 INFO L87 Difference]: Start difference. First operand 3803 states and 6190 transitions. Second operand 4 states. [2019-09-10 06:11:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:07,630 INFO L93 Difference]: Finished difference Result 5471 states and 8913 transitions. [2019-09-10 06:11:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:07,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-10 06:11:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:07,659 INFO L225 Difference]: With dead ends: 5471 [2019-09-10 06:11:07,660 INFO L226 Difference]: Without dead ends: 5471 [2019-09-10 06:11:07,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2019-09-10 06:11:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 5444. [2019-09-10 06:11:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2019-09-10 06:11:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 8865 transitions. [2019-09-10 06:11:07,850 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 8865 transitions. Word has length 68 [2019-09-10 06:11:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:07,852 INFO L475 AbstractCegarLoop]: Abstraction has 5444 states and 8865 transitions. [2019-09-10 06:11:07,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 8865 transitions. [2019-09-10 06:11:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:11:07,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:07,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:07,864 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-10 06:11:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:07,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:07,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:07,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:07,961 INFO L87 Difference]: Start difference. First operand 5444 states and 8865 transitions. Second operand 3 states. [2019-09-10 06:11:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:08,051 INFO L93 Difference]: Finished difference Result 7998 states and 12991 transitions. [2019-09-10 06:11:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:08,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:11:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:08,095 INFO L225 Difference]: With dead ends: 7998 [2019-09-10 06:11:08,095 INFO L226 Difference]: Without dead ends: 7998 [2019-09-10 06:11:08,096 INFO L628 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 [2019-09-10 06:11:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2019-09-10 06:11:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 7996. [2019-09-10 06:11:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7996 states. [2019-09-10 06:11:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7996 states to 7996 states and 12990 transitions. [2019-09-10 06:11:08,370 INFO L78 Accepts]: Start accepts. Automaton has 7996 states and 12990 transitions. Word has length 69 [2019-09-10 06:11:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:08,371 INFO L475 AbstractCegarLoop]: Abstraction has 7996 states and 12990 transitions. [2019-09-10 06:11:08,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7996 states and 12990 transitions. [2019-09-10 06:11:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:11:08,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:08,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:08,374 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-10 06:11:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:08,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:08,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:08,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:08,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:08,460 INFO L87 Difference]: Start difference. First operand 7996 states and 12990 transitions. Second operand 3 states. [2019-09-10 06:11:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:08,533 INFO L93 Difference]: Finished difference Result 10915 states and 17673 transitions. [2019-09-10 06:11:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:08,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:11:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:08,593 INFO L225 Difference]: With dead ends: 10915 [2019-09-10 06:11:08,593 INFO L226 Difference]: Without dead ends: 10915 [2019-09-10 06:11:08,594 INFO L628 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 [2019-09-10 06:11:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2019-09-10 06:11:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 10913. [2019-09-10 06:11:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10913 states. [2019-09-10 06:11:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10913 states to 10913 states and 17672 transitions. [2019-09-10 06:11:08,789 INFO L78 Accepts]: Start accepts. Automaton has 10913 states and 17672 transitions. Word has length 69 [2019-09-10 06:11:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:08,789 INFO L475 AbstractCegarLoop]: Abstraction has 10913 states and 17672 transitions. [2019-09-10 06:11:08,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10913 states and 17672 transitions. [2019-09-10 06:11:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:11:08,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:08,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:08,792 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-10 06:11:08,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:08,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:08,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:08,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:08,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:08,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:08,862 INFO L87 Difference]: Start difference. First operand 10913 states and 17672 transitions. Second operand 4 states. [2019-09-10 06:11:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:09,025 INFO L93 Difference]: Finished difference Result 20957 states and 34035 transitions. [2019-09-10 06:11:09,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:09,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:11:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:09,180 INFO L225 Difference]: With dead ends: 20957 [2019-09-10 06:11:09,180 INFO L226 Difference]: Without dead ends: 20957 [2019-09-10 06:11:09,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20957 states. [2019-09-10 06:11:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20957 to 15887. [2019-09-10 06:11:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15887 states. [2019-09-10 06:11:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15887 states to 15887 states and 25717 transitions. [2019-09-10 06:11:09,503 INFO L78 Accepts]: Start accepts. Automaton has 15887 states and 25717 transitions. Word has length 69 [2019-09-10 06:11:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:09,503 INFO L475 AbstractCegarLoop]: Abstraction has 15887 states and 25717 transitions. [2019-09-10 06:11:09,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15887 states and 25717 transitions. [2019-09-10 06:11:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:11:09,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:09,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:09,505 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-10 06:11:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:09,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:09,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:09,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:09,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:09,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:09,560 INFO L87 Difference]: Start difference. First operand 15887 states and 25717 transitions. Second operand 3 states. [2019-09-10 06:11:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:10,081 INFO L93 Difference]: Finished difference Result 23756 states and 38372 transitions. [2019-09-10 06:11:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:11:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:10,145 INFO L225 Difference]: With dead ends: 23756 [2019-09-10 06:11:10,146 INFO L226 Difference]: Without dead ends: 23756 [2019-09-10 06:11:10,146 INFO L628 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 [2019-09-10 06:11:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23756 states. [2019-09-10 06:11:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23756 to 23754. [2019-09-10 06:11:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23754 states. [2019-09-10 06:11:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23754 states to 23754 states and 38371 transitions. [2019-09-10 06:11:10,574 INFO L78 Accepts]: Start accepts. Automaton has 23754 states and 38371 transitions. Word has length 69 [2019-09-10 06:11:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:10,575 INFO L475 AbstractCegarLoop]: Abstraction has 23754 states and 38371 transitions. [2019-09-10 06:11:10,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 23754 states and 38371 transitions. [2019-09-10 06:11:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:11:10,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:10,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:10,577 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-10 06:11:10,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:10,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:10,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:10,912 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-09-10 06:11:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:10,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:10,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:10,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:10,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:10,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:10,928 INFO L87 Difference]: Start difference. First operand 23754 states and 38371 transitions. Second operand 5 states. [2019-09-10 06:11:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:11,097 INFO L93 Difference]: Finished difference Result 25542 states and 41187 transitions. [2019-09-10 06:11:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:11,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:11:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:11,162 INFO L225 Difference]: With dead ends: 25542 [2019-09-10 06:11:11,162 INFO L226 Difference]: Without dead ends: 25542 [2019-09-10 06:11:11,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25542 states. [2019-09-10 06:11:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25542 to 23754. [2019-09-10 06:11:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23754 states. [2019-09-10 06:11:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23754 states to 23754 states and 38236 transitions. [2019-09-10 06:11:11,818 INFO L78 Accepts]: Start accepts. Automaton has 23754 states and 38236 transitions. Word has length 71 [2019-09-10 06:11:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:11,819 INFO L475 AbstractCegarLoop]: Abstraction has 23754 states and 38236 transitions. [2019-09-10 06:11:11,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23754 states and 38236 transitions. [2019-09-10 06:11:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:11:11,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:11,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:11,820 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-10 06:11:11,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:11,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:11,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:11,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:11,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:12,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:12,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:12,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:12,021 INFO L87 Difference]: Start difference. First operand 23754 states and 38236 transitions. Second operand 5 states. [2019-09-10 06:11:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:12,286 INFO L93 Difference]: Finished difference Result 43253 states and 69238 transitions. [2019-09-10 06:11:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:12,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:11:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:12,391 INFO L225 Difference]: With dead ends: 43253 [2019-09-10 06:11:12,391 INFO L226 Difference]: Without dead ends: 43253 [2019-09-10 06:11:12,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:11:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43253 states. [2019-09-10 06:11:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43253 to 43251. [2019-09-10 06:11:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43251 states. [2019-09-10 06:11:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43251 states to 43251 states and 69237 transitions. [2019-09-10 06:11:13,766 INFO L78 Accepts]: Start accepts. Automaton has 43251 states and 69237 transitions. Word has length 74 [2019-09-10 06:11:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:13,767 INFO L475 AbstractCegarLoop]: Abstraction has 43251 states and 69237 transitions. [2019-09-10 06:11:13,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 43251 states and 69237 transitions. [2019-09-10 06:11:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:11:13,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:13,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:13,768 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-10 06:11:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:13,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:13,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:13,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:13,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:13,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:13,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:13,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:13,870 INFO L87 Difference]: Start difference. First operand 43251 states and 69237 transitions. Second operand 5 states. [2019-09-10 06:11:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:14,131 INFO L93 Difference]: Finished difference Result 76097 states and 120552 transitions. [2019-09-10 06:11:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:11:14,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:11:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:14,284 INFO L225 Difference]: With dead ends: 76097 [2019-09-10 06:11:14,285 INFO L226 Difference]: Without dead ends: 76097 [2019-09-10 06:11:14,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:11:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76097 states. [2019-09-10 06:11:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76097 to 44327. [2019-09-10 06:11:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44327 states. [2019-09-10 06:11:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44327 states to 44327 states and 70304 transitions. [2019-09-10 06:11:16,702 INFO L78 Accepts]: Start accepts. Automaton has 44327 states and 70304 transitions. Word has length 75 [2019-09-10 06:11:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:16,702 INFO L475 AbstractCegarLoop]: Abstraction has 44327 states and 70304 transitions. [2019-09-10 06:11:16,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44327 states and 70304 transitions. [2019-09-10 06:11:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:11:16,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:16,704 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:16,705 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:16,705 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-10 06:11:16,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:16,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:16,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:11:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:16,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:16,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:16,842 INFO L87 Difference]: Start difference. First operand 44327 states and 70304 transitions. Second operand 5 states. [2019-09-10 06:11:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:17,151 INFO L93 Difference]: Finished difference Result 54677 states and 86659 transitions. [2019-09-10 06:11:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:17,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:11:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:17,259 INFO L225 Difference]: With dead ends: 54677 [2019-09-10 06:11:17,259 INFO L226 Difference]: Without dead ends: 54677 [2019-09-10 06:11:17,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54677 states. [2019-09-10 06:11:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54677 to 53535. [2019-09-10 06:11:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53535 states. [2019-09-10 06:11:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53535 states to 53535 states and 84784 transitions. [2019-09-10 06:11:18,128 INFO L78 Accepts]: Start accepts. Automaton has 53535 states and 84784 transitions. Word has length 97 [2019-09-10 06:11:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:18,128 INFO L475 AbstractCegarLoop]: Abstraction has 53535 states and 84784 transitions. [2019-09-10 06:11:18,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53535 states and 84784 transitions. [2019-09-10 06:11:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:11:18,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:18,130 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:18,130 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1464625966, now seen corresponding path program 1 times [2019-09-10 06:11:18,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:18,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:18,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:18,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:18,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:18,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:18,221 INFO L87 Difference]: Start difference. First operand 53535 states and 84784 transitions. Second operand 3 states. [2019-09-10 06:11:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:18,380 INFO L93 Difference]: Finished difference Result 46173 states and 73212 transitions. [2019-09-10 06:11:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:18,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:11:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:18,455 INFO L225 Difference]: With dead ends: 46173 [2019-09-10 06:11:18,455 INFO L226 Difference]: Without dead ends: 46173 [2019-09-10 06:11:18,456 INFO L628 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 [2019-09-10 06:11:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46173 states. [2019-09-10 06:11:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46173 to 46171. [2019-09-10 06:11:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46171 states. [2019-09-10 06:11:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46171 states to 46171 states and 73211 transitions. [2019-09-10 06:11:19,363 INFO L78 Accepts]: Start accepts. Automaton has 46171 states and 73211 transitions. Word has length 97 [2019-09-10 06:11:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:19,363 INFO L475 AbstractCegarLoop]: Abstraction has 46171 states and 73211 transitions. [2019-09-10 06:11:19,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 46171 states and 73211 transitions. [2019-09-10 06:11:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:11:19,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:19,366 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:19,366 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-10 06:11:19,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:19,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:19,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:19,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:19,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:19,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:19,444 INFO L87 Difference]: Start difference. First operand 46171 states and 73211 transitions. Second operand 3 states. [2019-09-10 06:11:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:19,508 INFO L93 Difference]: Finished difference Result 19087 states and 30196 transitions. [2019-09-10 06:11:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:19,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:11:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:19,536 INFO L225 Difference]: With dead ends: 19087 [2019-09-10 06:11:19,536 INFO L226 Difference]: Without dead ends: 19087 [2019-09-10 06:11:19,537 INFO L628 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 [2019-09-10 06:11:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2019-09-10 06:11:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 19085. [2019-09-10 06:11:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19085 states. [2019-09-10 06:11:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19085 states to 19085 states and 30195 transitions. [2019-09-10 06:11:19,762 INFO L78 Accepts]: Start accepts. Automaton has 19085 states and 30195 transitions. Word has length 97 [2019-09-10 06:11:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:19,763 INFO L475 AbstractCegarLoop]: Abstraction has 19085 states and 30195 transitions. [2019-09-10 06:11:19,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 19085 states and 30195 transitions. [2019-09-10 06:11:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:11:19,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:19,765 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:19,765 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1255185238, now seen corresponding path program 1 times [2019-09-10 06:11:19,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:19,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:19,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:19,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:19,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:11:19,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:11:19,873 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [140], [143], [145], [149], [154], [176], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [296], [299], [324], [332], [340], [346], [350], [354], [356], [358], [361], [386], [394], [402], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:11:19,927 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:11:19,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:11:20,106 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:11:20,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:11:20,492 INFO L272 AbstractInterpreter]: Visited 92 different actions 318 times. Merged at 46 different actions 207 times. Widened at 17 different actions 27 times. Performed 969 root evaluator evaluations with a maximum evaluation depth of 5. Performed 969 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 8 different actions. Largest state had 159 variables. [2019-09-10 06:11:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:20,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:11:20,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:20,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-10 06:11:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:20,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:11:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:20,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:11:20,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:11:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:11:20,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:11:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:11:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:11:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:11:20,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:20,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:20,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:20,846 INFO L87 Difference]: Start difference. First operand 19085 states and 30195 transitions. Second operand 5 states. [2019-09-10 06:11:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:20,987 INFO L93 Difference]: Finished difference Result 20919 states and 33042 transitions. [2019-09-10 06:11:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:20,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:11:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:21,034 INFO L225 Difference]: With dead ends: 20919 [2019-09-10 06:11:21,034 INFO L226 Difference]: Without dead ends: 20919 [2019-09-10 06:11:21,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-09-10 06:11:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 20705. [2019-09-10 06:11:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20705 states. [2019-09-10 06:11:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20705 states to 20705 states and 32751 transitions. [2019-09-10 06:11:22,299 INFO L78 Accepts]: Start accepts. Automaton has 20705 states and 32751 transitions. Word has length 99 [2019-09-10 06:11:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:22,299 INFO L475 AbstractCegarLoop]: Abstraction has 20705 states and 32751 transitions. [2019-09-10 06:11:22,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20705 states and 32751 transitions. [2019-09-10 06:11:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:11:22,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:22,304 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:22,304 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -464235949, now seen corresponding path program 1 times [2019-09-10 06:11:22,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:22,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:22,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:11:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:22,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:22,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:22,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:22,424 INFO L87 Difference]: Start difference. First operand 20705 states and 32751 transitions. Second operand 3 states. [2019-09-10 06:11:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:22,605 INFO L93 Difference]: Finished difference Result 37155 states and 58727 transitions. [2019-09-10 06:11:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:22,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:11:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:22,703 INFO L225 Difference]: With dead ends: 37155 [2019-09-10 06:11:22,703 INFO L226 Difference]: Without dead ends: 37155 [2019-09-10 06:11:22,704 INFO L628 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 [2019-09-10 06:11:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37155 states. [2019-09-10 06:11:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37155 to 37094. [2019-09-10 06:11:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37094 states. [2019-09-10 06:11:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37094 states to 37094 states and 58667 transitions. [2019-09-10 06:11:23,947 INFO L78 Accepts]: Start accepts. Automaton has 37094 states and 58667 transitions. Word has length 100 [2019-09-10 06:11:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:23,948 INFO L475 AbstractCegarLoop]: Abstraction has 37094 states and 58667 transitions. [2019-09-10 06:11:23,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37094 states and 58667 transitions. [2019-09-10 06:11:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:11:23,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:23,950 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:23,951 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 358983543, now seen corresponding path program 1 times [2019-09-10 06:11:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:23,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:24,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:24,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:24,032 INFO L87 Difference]: Start difference. First operand 37094 states and 58667 transitions. Second operand 3 states. [2019-09-10 06:11:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:24,086 INFO L93 Difference]: Finished difference Result 16247 states and 25602 transitions. [2019-09-10 06:11:24,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:24,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:11:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:24,120 INFO L225 Difference]: With dead ends: 16247 [2019-09-10 06:11:24,120 INFO L226 Difference]: Without dead ends: 16247 [2019-09-10 06:11:24,121 INFO L628 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 [2019-09-10 06:11:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2019-09-10 06:11:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 16245. [2019-09-10 06:11:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-09-10 06:11:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 25601 transitions. [2019-09-10 06:11:24,691 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 25601 transitions. Word has length 100 [2019-09-10 06:11:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:24,692 INFO L475 AbstractCegarLoop]: Abstraction has 16245 states and 25601 transitions. [2019-09-10 06:11:24,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 25601 transitions. [2019-09-10 06:11:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:11:24,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:24,694 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:24,695 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-10 06:11:24,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:24,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:24,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:24,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:24,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:24,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:11:24,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:11:24,802 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [346], [350], [354], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:11:24,812 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:11:24,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:11:24,845 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:11:25,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:11:25,188 INFO L272 AbstractInterpreter]: Visited 99 different actions 409 times. Merged at 53 different actions 282 times. Widened at 19 different actions 45 times. Performed 1216 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 9 different actions. Largest state had 159 variables. [2019-09-10 06:11:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:25,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:11:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:25,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:11:25,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:25,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:11:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:25,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:11:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:11:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:11:25,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:11:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:11:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:11:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:11:25,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:25,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:25,520 INFO L87 Difference]: Start difference. First operand 16245 states and 25601 transitions. Second operand 5 states. [2019-09-10 06:11:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:25,645 INFO L93 Difference]: Finished difference Result 16756 states and 26375 transitions. [2019-09-10 06:11:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:25,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:11:25,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:25,679 INFO L225 Difference]: With dead ends: 16756 [2019-09-10 06:11:25,680 INFO L226 Difference]: Without dead ends: 16756 [2019-09-10 06:11:25,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16756 states. [2019-09-10 06:11:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16756 to 16245. [2019-09-10 06:11:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-09-10 06:11:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 25565 transitions. [2019-09-10 06:11:25,987 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 25565 transitions. Word has length 101 [2019-09-10 06:11:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:25,988 INFO L475 AbstractCegarLoop]: Abstraction has 16245 states and 25565 transitions. [2019-09-10 06:11:25,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 25565 transitions. [2019-09-10 06:11:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:11:25,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:25,991 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:25,991 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-10 06:11:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:25,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:25,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:25,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:25,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:11:26,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:26,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:26,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:26,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:26,190 INFO L87 Difference]: Start difference. First operand 16245 states and 25565 transitions. Second operand 4 states. [2019-09-10 06:11:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:26,303 INFO L93 Difference]: Finished difference Result 31624 states and 49391 transitions. [2019-09-10 06:11:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:26,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:11:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:26,346 INFO L225 Difference]: With dead ends: 31624 [2019-09-10 06:11:26,346 INFO L226 Difference]: Without dead ends: 31624 [2019-09-10 06:11:26,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31624 states. [2019-09-10 06:11:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31624 to 31622. [2019-09-10 06:11:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31622 states. [2019-09-10 06:11:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31622 states to 31622 states and 49390 transitions. [2019-09-10 06:11:27,087 INFO L78 Accepts]: Start accepts. Automaton has 31622 states and 49390 transitions. Word has length 102 [2019-09-10 06:11:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:27,088 INFO L475 AbstractCegarLoop]: Abstraction has 31622 states and 49390 transitions. [2019-09-10 06:11:27,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31622 states and 49390 transitions. [2019-09-10 06:11:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:11:27,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:27,091 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:27,092 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-10 06:11:27,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:27,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:11:27,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:27,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:27,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:27,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:27,165 INFO L87 Difference]: Start difference. First operand 31622 states and 49390 transitions. Second operand 3 states. [2019-09-10 06:11:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:27,334 INFO L93 Difference]: Finished difference Result 63230 states and 98759 transitions. [2019-09-10 06:11:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:27,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:11:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:27,436 INFO L225 Difference]: With dead ends: 63230 [2019-09-10 06:11:27,436 INFO L226 Difference]: Without dead ends: 63230 [2019-09-10 06:11:27,437 INFO L628 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 [2019-09-10 06:11:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63230 states. [2019-09-10 06:11:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63230 to 31624. [2019-09-10 06:11:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31624 states. [2019-09-10 06:11:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31624 states to 31624 states and 49392 transitions. [2019-09-10 06:11:28,190 INFO L78 Accepts]: Start accepts. Automaton has 31624 states and 49392 transitions. Word has length 103 [2019-09-10 06:11:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:28,191 INFO L475 AbstractCegarLoop]: Abstraction has 31624 states and 49392 transitions. [2019-09-10 06:11:28,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 31624 states and 49392 transitions. [2019-09-10 06:11:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:11:28,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:28,194 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:28,194 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-10 06:11:28,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:28,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:28,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:28,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:11:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:28,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:28,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:28,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:28,267 INFO L87 Difference]: Start difference. First operand 31624 states and 49392 transitions. Second operand 3 states. [2019-09-10 06:11:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:28,433 INFO L93 Difference]: Finished difference Result 61522 states and 95320 transitions. [2019-09-10 06:11:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:28,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 06:11:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:28,511 INFO L225 Difference]: With dead ends: 61522 [2019-09-10 06:11:28,511 INFO L226 Difference]: Without dead ends: 61522 [2019-09-10 06:11:28,512 INFO L628 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 [2019-09-10 06:11:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61522 states. [2019-09-10 06:11:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61522 to 61520. [2019-09-10 06:11:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61520 states. [2019-09-10 06:11:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61520 states to 61520 states and 95319 transitions. [2019-09-10 06:11:29,432 INFO L78 Accepts]: Start accepts. Automaton has 61520 states and 95319 transitions. Word has length 104 [2019-09-10 06:11:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:29,432 INFO L475 AbstractCegarLoop]: Abstraction has 61520 states and 95319 transitions. [2019-09-10 06:11:29,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 61520 states and 95319 transitions. [2019-09-10 06:11:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:11:29,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:29,437 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:29,437 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-10 06:11:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:29,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:11:29,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:29,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:29,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:29,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:29,540 INFO L87 Difference]: Start difference. First operand 61520 states and 95319 transitions. Second operand 4 states. [2019-09-10 06:11:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:29,690 INFO L93 Difference]: Finished difference Result 47057 states and 72599 transitions. [2019-09-10 06:11:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:29,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:11:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:29,774 INFO L225 Difference]: With dead ends: 47057 [2019-09-10 06:11:29,774 INFO L226 Difference]: Without dead ends: 46997 [2019-09-10 06:11:29,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46997 states. [2019-09-10 06:11:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46997 to 46997. [2019-09-10 06:11:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46997 states. [2019-09-10 06:11:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46997 states to 46997 states and 72513 transitions. [2019-09-10 06:11:31,124 INFO L78 Accepts]: Start accepts. Automaton has 46997 states and 72513 transitions. Word has length 104 [2019-09-10 06:11:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:31,125 INFO L475 AbstractCegarLoop]: Abstraction has 46997 states and 72513 transitions. [2019-09-10 06:11:31,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 46997 states and 72513 transitions. [2019-09-10 06:11:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:11:31,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:31,129 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:31,129 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-10 06:11:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:31,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:31,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:31,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:31,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:11:31,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:11:31,308 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [157], [160], [171], [174], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [350], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [426], [429], [432], [434], [448], [456], [575], [576], [580], [581], [582] [2019-09-10 06:11:31,312 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:11:31,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:11:31,339 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:11:31,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:11:31,677 INFO L272 AbstractInterpreter]: Visited 104 different actions 577 times. Merged at 58 different actions 435 times. Widened at 24 different actions 89 times. Performed 1612 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1612 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 15 different actions. Largest state had 160 variables. [2019-09-10 06:11:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:31,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:11:31,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:11:31,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:11:31,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:31,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:11:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:31,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:11:31,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:11:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:11:31,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:11:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:11:31,922 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:11:31,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 06:11:31,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:31,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:31,924 INFO L87 Difference]: Start difference. First operand 46997 states and 72513 transitions. Second operand 4 states. [2019-09-10 06:11:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:32,211 INFO L93 Difference]: Finished difference Result 73299 states and 112819 transitions. [2019-09-10 06:11:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:32,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:11:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:32,351 INFO L225 Difference]: With dead ends: 73299 [2019-09-10 06:11:32,351 INFO L226 Difference]: Without dead ends: 73299 [2019-09-10 06:11:32,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:11:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73299 states. [2019-09-10 06:11:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73299 to 73153. [2019-09-10 06:11:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73153 states. [2019-09-10 06:11:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73153 states to 73153 states and 112674 transitions. [2019-09-10 06:11:33,076 INFO L78 Accepts]: Start accepts. Automaton has 73153 states and 112674 transitions. Word has length 106 [2019-09-10 06:11:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:33,076 INFO L475 AbstractCegarLoop]: Abstraction has 73153 states and 112674 transitions. [2019-09-10 06:11:33,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 73153 states and 112674 transitions. [2019-09-10 06:11:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:11:33,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:33,082 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:33,082 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-10 06:11:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:33,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:33,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:11:33,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:33,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:33,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:33,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:33,221 INFO L87 Difference]: Start difference. First operand 73153 states and 112674 transitions. Second operand 4 states. [2019-09-10 06:11:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:33,836 INFO L93 Difference]: Finished difference Result 119605 states and 182297 transitions. [2019-09-10 06:11:33,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:33,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:11:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:34,019 INFO L225 Difference]: With dead ends: 119605 [2019-09-10 06:11:34,019 INFO L226 Difference]: Without dead ends: 119605 [2019-09-10 06:11:34,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119605 states. [2019-09-10 06:11:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119605 to 119603. [2019-09-10 06:11:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119603 states. [2019-09-10 06:11:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119603 states to 119603 states and 182296 transitions. [2019-09-10 06:11:37,370 INFO L78 Accepts]: Start accepts. Automaton has 119603 states and 182296 transitions. Word has length 106 [2019-09-10 06:11:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:37,372 INFO L475 AbstractCegarLoop]: Abstraction has 119603 states and 182296 transitions. [2019-09-10 06:11:37,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 119603 states and 182296 transitions. [2019-09-10 06:11:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:11:37,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:37,378 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:37,378 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:37,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:37,379 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-10 06:11:37,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:37,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:11:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:37,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:37,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:37,453 INFO L87 Difference]: Start difference. First operand 119603 states and 182296 transitions. Second operand 3 states. [2019-09-10 06:11:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:37,985 INFO L93 Difference]: Finished difference Result 232420 states and 351067 transitions. [2019-09-10 06:11:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:37,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 06:11:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:38,338 INFO L225 Difference]: With dead ends: 232420 [2019-09-10 06:11:38,338 INFO L226 Difference]: Without dead ends: 232420 [2019-09-10 06:11:38,339 INFO L628 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 [2019-09-10 06:11:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232420 states. [2019-09-10 06:11:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232420 to 232418. [2019-09-10 06:11:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232418 states. [2019-09-10 06:11:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232418 states to 232418 states and 351066 transitions. [2019-09-10 06:11:44,213 INFO L78 Accepts]: Start accepts. Automaton has 232418 states and 351066 transitions. Word has length 108 [2019-09-10 06:11:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:44,213 INFO L475 AbstractCegarLoop]: Abstraction has 232418 states and 351066 transitions. [2019-09-10 06:11:44,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 232418 states and 351066 transitions. [2019-09-10 06:11:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:11:44,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:44,220 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:44,221 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-10 06:11:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:11:44,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:44,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:44,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:44,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:44,323 INFO L87 Difference]: Start difference. First operand 232418 states and 351066 transitions. Second operand 4 states. [2019-09-10 06:11:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:44,783 INFO L93 Difference]: Finished difference Result 188656 states and 284117 transitions. [2019-09-10 06:11:44,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:44,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:11:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:45,034 INFO L225 Difference]: With dead ends: 188656 [2019-09-10 06:11:45,035 INFO L226 Difference]: Without dead ends: 188608 [2019-09-10 06:11:45,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188608 states. [2019-09-10 06:11:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188608 to 188608. [2019-09-10 06:11:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188608 states. [2019-09-10 06:11:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188608 states to 188608 states and 284054 transitions. [2019-09-10 06:11:51,443 INFO L78 Accepts]: Start accepts. Automaton has 188608 states and 284054 transitions. Word has length 108 [2019-09-10 06:11:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:51,443 INFO L475 AbstractCegarLoop]: Abstraction has 188608 states and 284054 transitions. [2019-09-10 06:11:51,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 188608 states and 284054 transitions. [2019-09-10 06:11:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:11:51,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:51,450 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:51,450 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-10 06:11:51,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:11:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:51,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:51,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:51,502 INFO L87 Difference]: Start difference. First operand 188608 states and 284054 transitions. Second operand 3 states. [2019-09-10 06:11:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:53,674 INFO L93 Difference]: Finished difference Result 373391 states and 557791 transitions. [2019-09-10 06:11:53,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:53,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:11:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:54,442 INFO L225 Difference]: With dead ends: 373391 [2019-09-10 06:11:54,442 INFO L226 Difference]: Without dead ends: 373391 [2019-09-10 06:11:54,442 INFO L628 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 [2019-09-10 06:11:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373391 states. [2019-09-10 06:12:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373391 to 373389. [2019-09-10 06:12:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373389 states. [2019-09-10 06:12:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373389 states to 373389 states and 557790 transitions. [2019-09-10 06:12:03,994 INFO L78 Accepts]: Start accepts. Automaton has 373389 states and 557790 transitions. Word has length 110 [2019-09-10 06:12:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:03,994 INFO L475 AbstractCegarLoop]: Abstraction has 373389 states and 557790 transitions. [2019-09-10 06:12:03,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 373389 states and 557790 transitions. [2019-09-10 06:12:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:12:04,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:04,008 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:12:04,008 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-10 06:12:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:12:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:04,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:04,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:04,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:04,141 INFO L87 Difference]: Start difference. First operand 373389 states and 557790 transitions. Second operand 4 states. [2019-09-10 06:12:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:05,978 INFO L93 Difference]: Finished difference Result 725588 states and 1073246 transitions. [2019-09-10 06:12:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:05,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:12:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:07,217 INFO L225 Difference]: With dead ends: 725588 [2019-09-10 06:12:07,218 INFO L226 Difference]: Without dead ends: 725588 [2019-09-10 06:12:07,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725588 states. [2019-09-10 06:12:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725588 to 725586. [2019-09-10 06:12:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725586 states. [2019-09-10 06:12:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725586 states to 725586 states and 1073245 transitions. [2019-09-10 06:12:39,404 INFO L78 Accepts]: Start accepts. Automaton has 725586 states and 1073245 transitions. Word has length 110 [2019-09-10 06:12:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:39,405 INFO L475 AbstractCegarLoop]: Abstraction has 725586 states and 1073245 transitions. [2019-09-10 06:12:39,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 725586 states and 1073245 transitions. [2019-09-10 06:12:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:12:39,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:39,429 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:12:39,430 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 325039021, now seen corresponding path program 1 times [2019-09-10 06:12:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:12:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:39,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:39,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:39,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:39,477 INFO L87 Difference]: Start difference. First operand 725586 states and 1073245 transitions. Second operand 3 states. [2019-09-10 06:12:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:45,638 INFO L93 Difference]: Finished difference Result 1451082 states and 2146373 transitions. [2019-09-10 06:12:45,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:45,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 06:12:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:59,988 INFO L225 Difference]: With dead ends: 1451082 [2019-09-10 06:12:59,988 INFO L226 Difference]: Without dead ends: 1451082 [2019-09-10 06:12:59,988 INFO L628 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 [2019-09-10 06:13:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451082 states. [2019-09-10 06:13:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451082 to 725592. [2019-09-10 06:13:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725592 states. [2019-09-10 06:13:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725592 states to 725592 states and 1073251 transitions. [2019-09-10 06:13:28,461 INFO L78 Accepts]: Start accepts. Automaton has 725592 states and 1073251 transitions. Word has length 111 [2019-09-10 06:13:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:28,461 INFO L475 AbstractCegarLoop]: Abstraction has 725592 states and 1073251 transitions. [2019-09-10 06:13:28,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 725592 states and 1073251 transitions. [2019-09-10 06:13:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:13:28,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:28,479 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:13:28,480 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash -585328086, now seen corresponding path program 1 times [2019-09-10 06:13:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:28,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:28,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:13:28,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:28,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:28,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:28,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:28,587 INFO L87 Difference]: Start difference. First operand 725592 states and 1073251 transitions. Second operand 4 states. [2019-09-10 06:13:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:37,524 INFO L93 Difference]: Finished difference Result 725777 states and 1073467 transitions. [2019-09-10 06:13:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:37,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:13:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:38,543 INFO L225 Difference]: With dead ends: 725777 [2019-09-10 06:13:38,543 INFO L226 Difference]: Without dead ends: 725586 [2019-09-10 06:13:38,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725586 states. [2019-09-10 06:13:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725586 to 725586. [2019-09-10 06:13:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725586 states. [2019-09-10 06:13:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725586 states to 725586 states and 1073239 transitions. [2019-09-10 06:13:58,346 INFO L78 Accepts]: Start accepts. Automaton has 725586 states and 1073239 transitions. Word has length 112 [2019-09-10 06:13:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:58,346 INFO L475 AbstractCegarLoop]: Abstraction has 725586 states and 1073239 transitions. [2019-09-10 06:13:58,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 725586 states and 1073239 transitions. [2019-09-10 06:13:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:13:58,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:58,366 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:13:58,366 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1224543300, now seen corresponding path program 1 times [2019-09-10 06:13:58,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:13:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:58,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:58,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:58,445 INFO L87 Difference]: Start difference. First operand 725586 states and 1073239 transitions. Second operand 3 states. [2019-09-10 06:14:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:11,568 INFO L93 Difference]: Finished difference Result 1077819 states and 1571834 transitions. [2019-09-10 06:14:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:11,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:14:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:13,480 INFO L225 Difference]: With dead ends: 1077819 [2019-09-10 06:14:13,480 INFO L226 Difference]: Without dead ends: 1077819 [2019-09-10 06:14:13,480 INFO L628 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 [2019-09-10 06:14:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077819 states. [2019-09-10 06:14:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077819 to 1077817. [2019-09-10 06:14:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077817 states. [2019-09-10 06:14:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077817 states to 1077817 states and 1571833 transitions. [2019-09-10 06:14:45,317 INFO L78 Accepts]: Start accepts. Automaton has 1077817 states and 1571833 transitions. Word has length 112 [2019-09-10 06:14:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:45,318 INFO L475 AbstractCegarLoop]: Abstraction has 1077817 states and 1571833 transitions. [2019-09-10 06:14:45,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1077817 states and 1571833 transitions. [2019-09-10 06:14:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:14:45,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:45,341 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:14:45,341 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash -686184826, now seen corresponding path program 1 times [2019-09-10 06:14:45,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:14:45,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:45,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:14:45,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:45,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:14:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:14:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:45,425 INFO L87 Difference]: Start difference. First operand 1077817 states and 1571833 transitions. Second operand 5 states. [2019-09-10 06:14:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:58,987 INFO L93 Difference]: Finished difference Result 1077817 states and 1555483 transitions. [2019-09-10 06:14:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:14:58,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 06:14:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:00,988 INFO L225 Difference]: With dead ends: 1077817 [2019-09-10 06:15:00,988 INFO L226 Difference]: Without dead ends: 1077817 [2019-09-10 06:15:00,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:15:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077817 states. [2019-09-10 06:15:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077817 to 1077817. [2019-09-10 06:15:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077817 states. [2019-09-10 06:15:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077817 states to 1077817 states and 1555483 transitions. [2019-09-10 06:15:40,292 INFO L78 Accepts]: Start accepts. Automaton has 1077817 states and 1555483 transitions. Word has length 114 [2019-09-10 06:15:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:40,292 INFO L475 AbstractCegarLoop]: Abstraction has 1077817 states and 1555483 transitions. [2019-09-10 06:15:40,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:15:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1077817 states and 1555483 transitions. [2019-09-10 06:15:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:15:40,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:40,313 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:15:40,314 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 119728619, now seen corresponding path program 1 times [2019-09-10 06:15:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:40,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:40,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:15:40,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:40,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:40,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:40,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:40,443 INFO L87 Difference]: Start difference. First operand 1077817 states and 1555483 transitions. Second operand 4 states. [2019-09-10 06:15:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:44,629 INFO L93 Difference]: Finished difference Result 949363 states and 1366739 transitions. [2019-09-10 06:15:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:44,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:15:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:46,355 INFO L225 Difference]: With dead ends: 949363 [2019-09-10 06:15:46,355 INFO L226 Difference]: Without dead ends: 949363 [2019-09-10 06:15:46,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:15:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949363 states. [2019-09-10 06:16:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949363 to 949294. [2019-09-10 06:16:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949294 states. [2019-09-10 06:16:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949294 states to 949294 states and 1366659 transitions. [2019-09-10 06:16:26,243 INFO L78 Accepts]: Start accepts. Automaton has 949294 states and 1366659 transitions. Word has length 114 [2019-09-10 06:16:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:26,243 INFO L475 AbstractCegarLoop]: Abstraction has 949294 states and 1366659 transitions. [2019-09-10 06:16:26,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 949294 states and 1366659 transitions. [2019-09-10 06:16:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:16:26,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:26,265 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:16:26,265 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2108930601, now seen corresponding path program 1 times [2019-09-10 06:16:26,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:26,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:26,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:16:26,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:16:26,433 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [126], [129], [145], [149], [154], [157], [171], [174], [176], [180], [185], [195], [198], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [292], [294], [296], [299], [324], [332], [340], [350], [352], [356], [358], [361], [364], [367], [370], [372], [376], [379], [382], [384], [386], [408], [412], [418], [420], [423], [426], [429], [432], [434], [448], [456], [548], [551], [554], [575], [576], [580], [581], [582] [2019-09-10 06:16:26,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:16:26,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:16:26,472 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:16:26,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:16:26,847 INFO L272 AbstractInterpreter]: Visited 114 different actions 575 times. Merged at 66 different actions 428 times. Widened at 23 different actions 71 times. Performed 1774 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1774 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 15 different actions. Largest state had 162 variables. [2019-09-10 06:16:26,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:26,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:16:26,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:26,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:16:26,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:26,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:16:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:26,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:16:26,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:16:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:16:27,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:16:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:16:27,088 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:16:27,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 10 [2019-09-10 06:16:27,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:27,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:16:27,090 INFO L87 Difference]: Start difference. First operand 949294 states and 1366659 transitions. Second operand 4 states. [2019-09-10 06:16:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:33,028 INFO L93 Difference]: Finished difference Result 1617690 states and 2322618 transitions. [2019-09-10 06:16:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:33,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 06:16:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:48,272 INFO L225 Difference]: With dead ends: 1617690 [2019-09-10 06:16:48,272 INFO L226 Difference]: Without dead ends: 1617690 [2019-09-10 06:16:48,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:16:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617690 states. [2019-09-10 06:17:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617690 to 1584806. [2019-09-10 06:17:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584806 states. [2019-09-10 06:17:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584806 states to 1584806 states and 2277559 transitions. [2019-09-10 06:17:37,578 INFO L78 Accepts]: Start accepts. Automaton has 1584806 states and 2277559 transitions. Word has length 116 [2019-09-10 06:17:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:37,578 INFO L475 AbstractCegarLoop]: Abstraction has 1584806 states and 2277559 transitions. [2019-09-10 06:17:37,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1584806 states and 2277559 transitions. [2019-09-10 06:17:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:17:37,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:37,598 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:17:37,599 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2043833903, now seen corresponding path program 1 times [2019-09-10 06:17:37,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:37,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:17:37,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:37,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:17:37,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:37,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:17:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:17:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:17:37,712 INFO L87 Difference]: Start difference. First operand 1584806 states and 2277559 transitions. Second operand 4 states. [2019-09-10 06:17:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:55,357 INFO L93 Difference]: Finished difference Result 1585056 states and 2277833 transitions. [2019-09-10 06:17:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:17:55,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 06:17:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:59,671 INFO L225 Difference]: With dead ends: 1585056 [2019-09-10 06:17:59,671 INFO L226 Difference]: Without dead ends: 1585056 [2019-09-10 06:17:59,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585056 states.