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_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:49:43,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:49:43,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:49:43,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:49:43,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:49:43,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:49:43,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:49:43,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:49:43,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:49:43,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:49:43,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:49:43,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:49:43,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:49:43,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:49:43,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:49:43,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:49:43,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:49:43,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:49:43,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:49:43,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:49:43,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:49:43,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:49:43,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:49:43,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:49:43,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:49:43,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:49:43,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:49:43,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:49:43,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:49:43,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:49:43,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:49:43,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:49:43,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:49:43,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:49:43,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:49:43,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:49:43,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:49:43,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:49:43,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:49:43,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:49:43,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:49:43,449 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:49:43,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:49:43,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:49:43,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:49:43,464 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:49:43,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:49:43,465 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:49:43,465 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:49:43,466 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:49:43,466 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:49:43,466 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:49:43,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:49:43,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:49:43,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:49:43,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:49:43,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:49:43,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:49:43,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:49:43,468 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:49:43,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:49:43,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:49:43,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:49:43,469 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:49:43,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:49:43,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:49:43,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:49:43,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:49:43,470 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:49:43,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:49:43,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:49:43,470 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:49:43,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:49:43,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:49:43,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:49:43,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:49:43,527 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:49:43,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:49:43,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d28a4c7/32cd974ddc01406e8af495d8c4a0f467/FLAG43c0d9f38 [2019-09-10 06:49:44,119 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:49:44,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:49:44,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d28a4c7/32cd974ddc01406e8af495d8c4a0f467/FLAG43c0d9f38 [2019-09-10 06:49:44,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d28a4c7/32cd974ddc01406e8af495d8c4a0f467 [2019-09-10 06:49:44,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:49:44,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:49:44,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:49:44,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:49:44,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:49:44,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:49:44" (1/1) ... [2019-09-10 06:49:44,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa5746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:44, skipping insertion in model container [2019-09-10 06:49:44,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:49:44" (1/1) ... [2019-09-10 06:49:44,459 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:49:44,514 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:49:44,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:49:44,925 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:49:45,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:49:45,051 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:49:45,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45 WrapperNode [2019-09-10 06:49:45,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:49:45,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:49:45,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:49:45,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:49:45,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (1/1) ... [2019-09-10 06:49:45,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:49:45,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:49:45,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:49:45,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:49:45,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (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:49:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:49:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:49:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:49:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:49:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:49:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:49:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:49:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:49:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:49:46,086 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:49:46,086 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:49:46,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:49:46 BoogieIcfgContainer [2019-09-10 06:49:46,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:49:46,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:49:46,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:49:46,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:49:46,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:49:44" (1/3) ... [2019-09-10 06:49:46,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527cd753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:49:46, skipping insertion in model container [2019-09-10 06:49:46,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:49:45" (2/3) ... [2019-09-10 06:49:46,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527cd753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:49:46, skipping insertion in model container [2019-09-10 06:49:46,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:49:46" (3/3) ... [2019-09-10 06:49:46,097 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:49:46,107 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:49:46,116 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:49:46,134 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:49:46,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:49:46,162 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:49:46,162 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:49:46,163 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:49:46,163 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:49:46,163 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:49:46,163 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:49:46,164 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:49:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-09-10 06:49:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:49:46,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:46,201 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:49:46,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1532024012, now seen corresponding path program 1 times [2019-09-10 06:49:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:46,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:46,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:46,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:46,809 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:49:46,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:49:46,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:46,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:49:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:49:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:46,837 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 7 states. [2019-09-10 06:49:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:47,303 INFO L93 Difference]: Finished difference Result 1073 states and 1678 transitions. [2019-09-10 06:49:47,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:49:47,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 06:49:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:47,329 INFO L225 Difference]: With dead ends: 1073 [2019-09-10 06:49:47,329 INFO L226 Difference]: Without dead ends: 1025 [2019-09-10 06:49:47,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:49:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-09-10 06:49:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 515. [2019-09-10 06:49:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-10 06:49:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 790 transitions. [2019-09-10 06:49:47,421 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 790 transitions. Word has length 69 [2019-09-10 06:49:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:47,422 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 790 transitions. [2019-09-10 06:49:47,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:49:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 790 transitions. [2019-09-10 06:49:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:49:47,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:47,429 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] [2019-09-10 06:49:47,429 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -525222683, now seen corresponding path program 1 times [2019-09-10 06:49:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:47,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:47,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:47,718 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:49:47,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:47,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:47,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:47,729 INFO L87 Difference]: Start difference. First operand 515 states and 790 transitions. Second operand 6 states. [2019-09-10 06:49:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:47,974 INFO L93 Difference]: Finished difference Result 1392 states and 2135 transitions. [2019-09-10 06:49:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:49:47,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:49:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:47,982 INFO L225 Difference]: With dead ends: 1392 [2019-09-10 06:49:47,982 INFO L226 Difference]: Without dead ends: 1392 [2019-09-10 06:49:47,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-10 06:49:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2019-09-10 06:49:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-10 06:49:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2132 transitions. [2019-09-10 06:49:48,024 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2132 transitions. Word has length 70 [2019-09-10 06:49:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:48,024 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 2132 transitions. [2019-09-10 06:49:48,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2132 transitions. [2019-09-10 06:49:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:49:48,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:48,034 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:49:48,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:48,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash -550914758, now seen corresponding path program 1 times [2019-09-10 06:49:48,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:48,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:48,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:48,132 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:49:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:49:48,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:48,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:49:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:49:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:48,134 INFO L87 Difference]: Start difference. First operand 1386 states and 2132 transitions. Second operand 5 states. [2019-09-10 06:49:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:48,466 INFO L93 Difference]: Finished difference Result 2592 states and 3987 transitions. [2019-09-10 06:49:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:48,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:49:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:48,483 INFO L225 Difference]: With dead ends: 2592 [2019-09-10 06:49:48,483 INFO L226 Difference]: Without dead ends: 2592 [2019-09-10 06:49:48,483 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:49:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2019-09-10 06:49:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2019-09-10 06:49:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-09-10 06:49:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3986 transitions. [2019-09-10 06:49:48,583 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3986 transitions. Word has length 71 [2019-09-10 06:49:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:48,584 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3986 transitions. [2019-09-10 06:49:48,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3986 transitions. [2019-09-10 06:49:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:49:48,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:48,588 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:49:48,588 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127563, now seen corresponding path program 1 times [2019-09-10 06:49:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:48,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:48,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:48,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:48,770 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:49:48,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:48,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:48,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:48,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:48,774 INFO L87 Difference]: Start difference. First operand 2590 states and 3986 transitions. Second operand 6 states. [2019-09-10 06:49:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:49,146 INFO L93 Difference]: Finished difference Result 7062 states and 10843 transitions. [2019-09-10 06:49:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:49,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:49:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:49,179 INFO L225 Difference]: With dead ends: 7062 [2019-09-10 06:49:49,179 INFO L226 Difference]: Without dead ends: 7062 [2019-09-10 06:49:49,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:49:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2019-09-10 06:49:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7058. [2019-09-10 06:49:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7058 states. [2019-09-10 06:49:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 10841 transitions. [2019-09-10 06:49:49,336 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 10841 transitions. Word has length 71 [2019-09-10 06:49:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:49,336 INFO L475 AbstractCegarLoop]: Abstraction has 7058 states and 10841 transitions. [2019-09-10 06:49:49,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 10841 transitions. [2019-09-10 06:49:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:49:49,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:49,339 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:49:49,339 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash 968007085, now seen corresponding path program 1 times [2019-09-10 06:49:49,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:49,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:49,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:49,456 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:49:49,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:49,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:49,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:49,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:49,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:49,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:49,460 INFO L87 Difference]: Start difference. First operand 7058 states and 10841 transitions. Second operand 6 states. [2019-09-10 06:49:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:49,842 INFO L93 Difference]: Finished difference Result 19587 states and 30002 transitions. [2019-09-10 06:49:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:49,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:49:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:49,916 INFO L225 Difference]: With dead ends: 19587 [2019-09-10 06:49:49,916 INFO L226 Difference]: Without dead ends: 19587 [2019-09-10 06:49:49,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:49:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19587 states. [2019-09-10 06:49:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19587 to 17403. [2019-09-10 06:49:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17403 states. [2019-09-10 06:49:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17403 states to 17403 states and 26636 transitions. [2019-09-10 06:49:50,308 INFO L78 Accepts]: Start accepts. Automaton has 17403 states and 26636 transitions. Word has length 71 [2019-09-10 06:49:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:50,308 INFO L475 AbstractCegarLoop]: Abstraction has 17403 states and 26636 transitions. [2019-09-10 06:49:50,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 17403 states and 26636 transitions. [2019-09-10 06:49:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:49:50,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:50,311 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:49:50,312 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1314156252, now seen corresponding path program 1 times [2019-09-10 06:49:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:50,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:50,427 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:49:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:50,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:50,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:50,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:50,430 INFO L87 Difference]: Start difference. First operand 17403 states and 26636 transitions. Second operand 6 states. [2019-09-10 06:49:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:50,905 INFO L93 Difference]: Finished difference Result 49957 states and 76002 transitions. [2019-09-10 06:49:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:50,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:49:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:51,033 INFO L225 Difference]: With dead ends: 49957 [2019-09-10 06:49:51,034 INFO L226 Difference]: Without dead ends: 49957 [2019-09-10 06:49:51,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:49:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49957 states. [2019-09-10 06:49:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49957 to 49953. [2019-09-10 06:49:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49953 states. [2019-09-10 06:49:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49953 states to 49953 states and 76000 transitions. [2019-09-10 06:49:52,529 INFO L78 Accepts]: Start accepts. Automaton has 49953 states and 76000 transitions. Word has length 71 [2019-09-10 06:49:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:52,531 INFO L475 AbstractCegarLoop]: Abstraction has 49953 states and 76000 transitions. [2019-09-10 06:49:52,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49953 states and 76000 transitions. [2019-09-10 06:49:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:49:52,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:52,543 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] [2019-09-10 06:49:52,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -791998800, now seen corresponding path program 1 times [2019-09-10 06:49:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:52,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:52,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:52,672 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:49:52,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:52,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:49:52,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:52,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:49:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:49:52,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:52,674 INFO L87 Difference]: Start difference. First operand 49953 states and 76000 transitions. Second operand 5 states. [2019-09-10 06:49:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:53,081 INFO L93 Difference]: Finished difference Result 83091 states and 125086 transitions. [2019-09-10 06:49:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:49:53,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 06:49:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:53,291 INFO L225 Difference]: With dead ends: 83091 [2019-09-10 06:49:53,291 INFO L226 Difference]: Without dead ends: 83091 [2019-09-10 06:49:53,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:49:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83091 states. [2019-09-10 06:49:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83091 to 50745. [2019-09-10 06:49:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50745 states. [2019-09-10 06:49:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50745 states to 50745 states and 76558 transitions. [2019-09-10 06:49:55,154 INFO L78 Accepts]: Start accepts. Automaton has 50745 states and 76558 transitions. Word has length 72 [2019-09-10 06:49:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:55,154 INFO L475 AbstractCegarLoop]: Abstraction has 50745 states and 76558 transitions. [2019-09-10 06:49:55,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 50745 states and 76558 transitions. [2019-09-10 06:49:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:49:55,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:55,159 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] [2019-09-10 06:49:55,159 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1494388144, now seen corresponding path program 1 times [2019-09-10 06:49:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:55,302 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:49:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:49:55,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:55,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:49:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:49:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:49:55,304 INFO L87 Difference]: Start difference. First operand 50745 states and 76558 transitions. Second operand 4 states. [2019-09-10 06:49:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:55,822 INFO L93 Difference]: Finished difference Result 82052 states and 122699 transitions. [2019-09-10 06:49:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:49:55,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 06:49:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:55,945 INFO L225 Difference]: With dead ends: 82052 [2019-09-10 06:49:55,946 INFO L226 Difference]: Without dead ends: 82052 [2019-09-10 06:49:55,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:49:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82052 states. [2019-09-10 06:49:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82052 to 82050. [2019-09-10 06:49:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82050 states. [2019-09-10 06:49:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82050 states to 82050 states and 122698 transitions. [2019-09-10 06:49:57,900 INFO L78 Accepts]: Start accepts. Automaton has 82050 states and 122698 transitions. Word has length 73 [2019-09-10 06:49:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:57,901 INFO L475 AbstractCegarLoop]: Abstraction has 82050 states and 122698 transitions. [2019-09-10 06:49:57,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:49:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 82050 states and 122698 transitions. [2019-09-10 06:49:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:49:57,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:57,906 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:49:57,906 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1173196458, now seen corresponding path program 1 times [2019-09-10 06:49:57,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:57,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:57,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:57,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:58,002 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:49:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:49:58,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:58,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:49:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:49:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:58,004 INFO L87 Difference]: Start difference. First operand 82050 states and 122698 transitions. Second operand 7 states. [2019-09-10 06:49:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:59,615 INFO L93 Difference]: Finished difference Result 289954 states and 425894 transitions. [2019-09-10 06:49:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:49:59,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:49:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:00,014 INFO L225 Difference]: With dead ends: 289954 [2019-09-10 06:50:00,014 INFO L226 Difference]: Without dead ends: 289954 [2019-09-10 06:50:00,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289954 states. [2019-09-10 06:50:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289954 to 82080. [2019-09-10 06:50:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82080 states. [2019-09-10 06:50:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82080 states to 82080 states and 122734 transitions. [2019-09-10 06:50:04,112 INFO L78 Accepts]: Start accepts. Automaton has 82080 states and 122734 transitions. Word has length 74 [2019-09-10 06:50:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:04,112 INFO L475 AbstractCegarLoop]: Abstraction has 82080 states and 122734 transitions. [2019-09-10 06:50:04,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82080 states and 122734 transitions. [2019-09-10 06:50:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:04,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:04,116 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:50:04,116 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash 560209704, now seen corresponding path program 1 times [2019-09-10 06:50:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:04,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:04,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:04,170 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:50:04,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:04,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:04,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:04,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:04,174 INFO L87 Difference]: Start difference. First operand 82080 states and 122734 transitions. Second operand 3 states. [2019-09-10 06:50:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:04,557 INFO L93 Difference]: Finished difference Result 115834 states and 170227 transitions. [2019-09-10 06:50:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:04,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:50:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:04,735 INFO L225 Difference]: With dead ends: 115834 [2019-09-10 06:50:04,736 INFO L226 Difference]: Without dead ends: 115834 [2019-09-10 06:50:04,736 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:50:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115834 states. [2019-09-10 06:50:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115834 to 114499. [2019-09-10 06:50:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114499 states. [2019-09-10 06:50:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114499 states to 114499 states and 168893 transitions. [2019-09-10 06:50:06,281 INFO L78 Accepts]: Start accepts. Automaton has 114499 states and 168893 transitions. Word has length 74 [2019-09-10 06:50:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:06,281 INFO L475 AbstractCegarLoop]: Abstraction has 114499 states and 168893 transitions. [2019-09-10 06:50:06,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 114499 states and 168893 transitions. [2019-09-10 06:50:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:06,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:06,287 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:50:06,287 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 153092714, now seen corresponding path program 1 times [2019-09-10 06:50:06,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:06,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:06,337 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:50:06,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:06,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:06,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:06,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:06,339 INFO L87 Difference]: Start difference. First operand 114499 states and 168893 transitions. Second operand 3 states. [2019-09-10 06:50:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:08,483 INFO L93 Difference]: Finished difference Result 139446 states and 201119 transitions. [2019-09-10 06:50:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:08,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:50:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:08,633 INFO L225 Difference]: With dead ends: 139446 [2019-09-10 06:50:08,633 INFO L226 Difference]: Without dead ends: 139446 [2019-09-10 06:50:08,634 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:50:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139446 states. [2019-09-10 06:50:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139446 to 137725. [2019-09-10 06:50:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137725 states. [2019-09-10 06:50:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137725 states to 137725 states and 199399 transitions. [2019-09-10 06:50:09,964 INFO L78 Accepts]: Start accepts. Automaton has 137725 states and 199399 transitions. Word has length 74 [2019-09-10 06:50:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:09,964 INFO L475 AbstractCegarLoop]: Abstraction has 137725 states and 199399 transitions. [2019-09-10 06:50:09,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 137725 states and 199399 transitions. [2019-09-10 06:50:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:09,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:09,970 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:50:09,970 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:09,970 INFO L82 PathProgramCache]: Analyzing trace with hash 360963784, now seen corresponding path program 1 times [2019-09-10 06:50:09,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:09,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:10,050 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:50:10,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:10,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:10,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:10,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:10,052 INFO L87 Difference]: Start difference. First operand 137725 states and 199399 transitions. Second operand 7 states. [2019-09-10 06:50:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:12,870 INFO L93 Difference]: Finished difference Result 739450 states and 1062319 transitions. [2019-09-10 06:50:12,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:12,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:50:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:13,816 INFO L225 Difference]: With dead ends: 739450 [2019-09-10 06:50:13,816 INFO L226 Difference]: Without dead ends: 739450 [2019-09-10 06:50:13,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739450 states. [2019-09-10 06:50:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739450 to 137893. [2019-09-10 06:50:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137893 states. [2019-09-10 06:50:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137893 states to 137893 states and 199618 transitions. [2019-09-10 06:50:22,941 INFO L78 Accepts]: Start accepts. Automaton has 137893 states and 199618 transitions. Word has length 74 [2019-09-10 06:50:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:22,941 INFO L475 AbstractCegarLoop]: Abstraction has 137893 states and 199618 transitions. [2019-09-10 06:50:22,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 137893 states and 199618 transitions. [2019-09-10 06:50:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:22,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:22,946 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:50:22,947 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:22,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash -914256502, now seen corresponding path program 1 times [2019-09-10 06:50:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:22,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:22,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:22,993 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:50:22,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:22,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:22,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:22,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:22,994 INFO L87 Difference]: Start difference. First operand 137893 states and 199618 transitions. Second operand 3 states. [2019-09-10 06:50:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:23,464 INFO L93 Difference]: Finished difference Result 223040 states and 318403 transitions. [2019-09-10 06:50:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:23,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:50:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:23,729 INFO L225 Difference]: With dead ends: 223040 [2019-09-10 06:50:23,729 INFO L226 Difference]: Without dead ends: 223040 [2019-09-10 06:50:23,730 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:50:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223040 states. [2019-09-10 06:50:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223040 to 222340. [2019-09-10 06:50:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222340 states. [2019-09-10 06:50:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222340 states to 222340 states and 317699 transitions. [2019-09-10 06:50:30,712 INFO L78 Accepts]: Start accepts. Automaton has 222340 states and 317699 transitions. Word has length 74 [2019-09-10 06:50:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:30,712 INFO L475 AbstractCegarLoop]: Abstraction has 222340 states and 317699 transitions. [2019-09-10 06:50:30,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 222340 states and 317699 transitions. [2019-09-10 06:50:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:50:30,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:30,719 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:50:30,720 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1454128726, now seen corresponding path program 1 times [2019-09-10 06:50:30,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:30,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:30,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:30,804 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:50:30,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:30,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:50:30,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:30,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:50:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:50:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:50:30,805 INFO L87 Difference]: Start difference. First operand 222340 states and 317699 transitions. Second operand 7 states. [2019-09-10 06:50:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:34,525 INFO L93 Difference]: Finished difference Result 1060611 states and 1503388 transitions. [2019-09-10 06:50:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:50:34,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:50:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:35,962 INFO L225 Difference]: With dead ends: 1060611 [2019-09-10 06:50:35,963 INFO L226 Difference]: Without dead ends: 1060611 [2019-09-10 06:50:35,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:50:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060611 states. [2019-09-10 06:50:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060611 to 222578. [2019-09-10 06:50:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222578 states. [2019-09-10 06:50:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222578 states to 222578 states and 318005 transitions. [2019-09-10 06:50:49,604 INFO L78 Accepts]: Start accepts. Automaton has 222578 states and 318005 transitions. Word has length 74 [2019-09-10 06:50:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:49,604 INFO L475 AbstractCegarLoop]: Abstraction has 222578 states and 318005 transitions. [2019-09-10 06:50:49,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 222578 states and 318005 transitions. [2019-09-10 06:50:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:50:49,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:49,611 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, 1] [2019-09-10 06:50:49,612 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash -776383725, now seen corresponding path program 1 times [2019-09-10 06:50:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:49,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:49,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:50:49,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:49,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:49,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:49,696 INFO L87 Difference]: Start difference. First operand 222578 states and 318005 transitions. Second operand 6 states. [2019-09-10 06:50:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:52,096 INFO L93 Difference]: Finished difference Result 428812 states and 612630 transitions. [2019-09-10 06:50:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:50:52,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:50:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:52,658 INFO L225 Difference]: With dead ends: 428812 [2019-09-10 06:50:52,659 INFO L226 Difference]: Without dead ends: 428812 [2019-09-10 06:50:52,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428812 states. [2019-09-10 06:50:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428812 to 253518. [2019-09-10 06:50:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253518 states. [2019-09-10 06:50:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253518 states to 253518 states and 362780 transitions. [2019-09-10 06:50:58,302 INFO L78 Accepts]: Start accepts. Automaton has 253518 states and 362780 transitions. Word has length 76 [2019-09-10 06:50:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:58,302 INFO L475 AbstractCegarLoop]: Abstraction has 253518 states and 362780 transitions. [2019-09-10 06:50:58,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 253518 states and 362780 transitions. [2019-09-10 06:50:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:50:58,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:58,309 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, 1] [2019-09-10 06:50:58,309 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2051604011, now seen corresponding path program 1 times [2019-09-10 06:50:58,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:58,392 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:50:58,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:58,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:58,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:58,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:58,393 INFO L87 Difference]: Start difference. First operand 253518 states and 362780 transitions. Second operand 6 states. [2019-09-10 06:50:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:59,724 INFO L93 Difference]: Finished difference Result 450358 states and 644484 transitions. [2019-09-10 06:50:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:50:59,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:50:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:00,317 INFO L225 Difference]: With dead ends: 450358 [2019-09-10 06:51:00,317 INFO L226 Difference]: Without dead ends: 450358 [2019-09-10 06:51:00,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:51:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450358 states. [2019-09-10 06:51:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450358 to 281918. [2019-09-10 06:51:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281918 states. [2019-09-10 06:51:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281918 states to 281918 states and 403964 transitions. [2019-09-10 06:51:09,674 INFO L78 Accepts]: Start accepts. Automaton has 281918 states and 403964 transitions. Word has length 76 [2019-09-10 06:51:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:09,674 INFO L475 AbstractCegarLoop]: Abstraction has 281918 states and 403964 transitions. [2019-09-10 06:51:09,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:51:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 281918 states and 403964 transitions. [2019-09-10 06:51:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:51:09,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:09,681 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, 1] [2019-09-10 06:51:09,681 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -793277035, now seen corresponding path program 1 times [2019-09-10 06:51:09,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:09,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:09,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:09,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:09,764 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:51:09,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:51:09,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:09,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:51:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:51:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:51:09,765 INFO L87 Difference]: Start difference. First operand 281918 states and 403964 transitions. Second operand 6 states. [2019-09-10 06:51:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:11,959 INFO L93 Difference]: Finished difference Result 470334 states and 672926 transitions. [2019-09-10 06:51:11,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:51:11,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:51:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:12,602 INFO L225 Difference]: With dead ends: 470334 [2019-09-10 06:51:12,603 INFO L226 Difference]: Without dead ends: 470334 [2019-09-10 06:51:12,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:51:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470334 states. [2019-09-10 06:51:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470334 to 314929. [2019-09-10 06:51:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314929 states. [2019-09-10 06:51:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314929 states to 314929 states and 451762 transitions. [2019-09-10 06:51:21,854 INFO L78 Accepts]: Start accepts. Automaton has 314929 states and 451762 transitions. Word has length 76 [2019-09-10 06:51:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:21,855 INFO L475 AbstractCegarLoop]: Abstraction has 314929 states and 451762 transitions. [2019-09-10 06:51:21,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:51:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 314929 states and 451762 transitions. [2019-09-10 06:51:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:51:21,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:21,864 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1975709726, now seen corresponding path program 1 times [2019-09-10 06:51:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:21,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:21,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:21,910 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:51:21,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:21,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:21,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:21,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:21,912 INFO L87 Difference]: Start difference. First operand 314929 states and 451762 transitions. Second operand 3 states. [2019-09-10 06:51:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:23,908 INFO L93 Difference]: Finished difference Result 365479 states and 513887 transitions. [2019-09-10 06:51:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:23,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:51:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:24,526 INFO L225 Difference]: With dead ends: 365479 [2019-09-10 06:51:24,527 INFO L226 Difference]: Without dead ends: 363186 [2019-09-10 06:51:24,527 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:51:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363186 states. [2019-09-10 06:51:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363186 to 322055. [2019-09-10 06:51:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322055 states. [2019-09-10 06:51:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322055 states to 322055 states and 455561 transitions. [2019-09-10 06:51:33,349 INFO L78 Accepts]: Start accepts. Automaton has 322055 states and 455561 transitions. Word has length 79 [2019-09-10 06:51:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:33,349 INFO L475 AbstractCegarLoop]: Abstraction has 322055 states and 455561 transitions. [2019-09-10 06:51:33,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 322055 states and 455561 transitions. [2019-09-10 06:51:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:51:33,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:33,359 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, 1, 1, 1, 1] [2019-09-10 06:51:33,359 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 873902620, now seen corresponding path program 1 times [2019-09-10 06:51:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:33,433 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:51:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:51:33,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:33,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:51:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:51:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:51:33,434 INFO L87 Difference]: Start difference. First operand 322055 states and 455561 transitions. Second operand 7 states. [2019-09-10 06:51:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:42,758 INFO L93 Difference]: Finished difference Result 1334840 states and 1855823 transitions. [2019-09-10 06:51:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:51:42,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 06:51:42,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:45,421 INFO L225 Difference]: With dead ends: 1334840 [2019-09-10 06:51:45,421 INFO L226 Difference]: Without dead ends: 1334840 [2019-09-10 06:51:45,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:51:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334840 states. [2019-09-10 06:52:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334840 to 322591. [2019-09-10 06:52:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322591 states. [2019-09-10 06:52:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322591 states to 322591 states and 456216 transitions. [2019-09-10 06:52:02,039 INFO L78 Accepts]: Start accepts. Automaton has 322591 states and 456216 transitions. Word has length 79 [2019-09-10 06:52:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:02,039 INFO L475 AbstractCegarLoop]: Abstraction has 322591 states and 456216 transitions. [2019-09-10 06:52:02,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:52:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 322591 states and 456216 transitions. [2019-09-10 06:52:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:52:02,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:02,050 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:02,050 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1233701679, now seen corresponding path program 1 times [2019-09-10 06:52:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:02,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:02,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:02,279 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:52:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:52:02,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:02,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:52:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:52:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:52:02,281 INFO L87 Difference]: Start difference. First operand 322591 states and 456216 transitions. Second operand 10 states. [2019-09-10 06:52:06,311 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 06:52:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:10,839 INFO L93 Difference]: Finished difference Result 1424903 states and 1999325 transitions. [2019-09-10 06:52:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:52:10,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:52:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:12,584 INFO L225 Difference]: With dead ends: 1424903 [2019-09-10 06:52:12,585 INFO L226 Difference]: Without dead ends: 1424903 [2019-09-10 06:52:12,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:52:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424903 states. [2019-09-10 06:52:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424903 to 322318. [2019-09-10 06:52:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322318 states. [2019-09-10 06:52:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322318 states to 322318 states and 455785 transitions. [2019-09-10 06:52:32,272 INFO L78 Accepts]: Start accepts. Automaton has 322318 states and 455785 transitions. Word has length 81 [2019-09-10 06:52:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:32,272 INFO L475 AbstractCegarLoop]: Abstraction has 322318 states and 455785 transitions. [2019-09-10 06:52:32,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:52:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 322318 states and 455785 transitions. [2019-09-10 06:52:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:52:32,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:32,283 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:32,283 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -887115147, now seen corresponding path program 1 times [2019-09-10 06:52:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:32,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:32,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:32,468 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:52:32,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:32,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:52:32,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:32,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:52:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:52:32,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:52:32,470 INFO L87 Difference]: Start difference. First operand 322318 states and 455785 transitions. Second operand 10 states. [2019-09-10 06:52:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:43,191 INFO L93 Difference]: Finished difference Result 802402 states and 1122987 transitions. [2019-09-10 06:52:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:52:43,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:52:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:44,158 INFO L225 Difference]: With dead ends: 802402 [2019-09-10 06:52:44,158 INFO L226 Difference]: Without dead ends: 802327 [2019-09-10 06:52:44,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:52:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802327 states. [2019-09-10 06:52:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802327 to 322241. [2019-09-10 06:52:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322241 states. [2019-09-10 06:52:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322241 states to 322241 states and 455529 transitions. [2019-09-10 06:52:50,094 INFO L78 Accepts]: Start accepts. Automaton has 322241 states and 455529 transitions. Word has length 81 [2019-09-10 06:52:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:50,095 INFO L475 AbstractCegarLoop]: Abstraction has 322241 states and 455529 transitions. [2019-09-10 06:52:50,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:52:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 322241 states and 455529 transitions. [2019-09-10 06:52:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:52:50,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:50,101 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:50,101 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash 631700849, now seen corresponding path program 1 times [2019-09-10 06:52:50,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:50,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:50,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:50,288 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:52:50,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:50,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:52:50,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:50,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:52:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:52:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:52:50,289 INFO L87 Difference]: Start difference. First operand 322241 states and 455529 transitions. Second operand 10 states. [2019-09-10 06:53:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:04,580 INFO L93 Difference]: Finished difference Result 1324928 states and 1849590 transitions. [2019-09-10 06:53:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:53:04,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:53:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:06,390 INFO L225 Difference]: With dead ends: 1324928 [2019-09-10 06:53:06,391 INFO L226 Difference]: Without dead ends: 1324928 [2019-09-10 06:53:06,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:53:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324928 states. [2019-09-10 06:53:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324928 to 321892. [2019-09-10 06:53:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321892 states. [2019-09-10 06:53:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321892 states to 321892 states and 455053 transitions. [2019-09-10 06:53:17,026 INFO L78 Accepts]: Start accepts. Automaton has 321892 states and 455053 transitions. Word has length 81 [2019-09-10 06:53:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:17,026 INFO L475 AbstractCegarLoop]: Abstraction has 321892 states and 455053 transitions. [2019-09-10 06:53:17,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:53:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 321892 states and 455053 transitions. [2019-09-10 06:53:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:53:17,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:17,032 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:17,033 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1510628881, now seen corresponding path program 1 times [2019-09-10 06:53:17,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:17,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:17,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:17,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:17,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:17,249 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:53:17,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:17,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:53:17,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:17,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:53:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:53:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:53:17,251 INFO L87 Difference]: Start difference. First operand 321892 states and 455053 transitions. Second operand 10 states. [2019-09-10 06:53:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:21,488 INFO L93 Difference]: Finished difference Result 717644 states and 1008100 transitions. [2019-09-10 06:53:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:53:21,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:53:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:22,487 INFO L225 Difference]: With dead ends: 717644 [2019-09-10 06:53:22,488 INFO L226 Difference]: Without dead ends: 717644 [2019-09-10 06:53:22,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:53:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717644 states. [2019-09-10 06:53:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717644 to 321497. [2019-09-10 06:53:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321497 states. [2019-09-10 06:53:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321497 states to 321497 states and 454536 transitions. [2019-09-10 06:53:40,220 INFO L78 Accepts]: Start accepts. Automaton has 321497 states and 454536 transitions. Word has length 81 [2019-09-10 06:53:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:40,221 INFO L475 AbstractCegarLoop]: Abstraction has 321497 states and 454536 transitions. [2019-09-10 06:53:40,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:53:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 321497 states and 454536 transitions. [2019-09-10 06:53:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:53:40,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:40,226 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:40,226 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -998289140, now seen corresponding path program 1 times [2019-09-10 06:53:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:40,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:40,676 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:53:40,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:40,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:53:40,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:40,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:53:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:53:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:53:40,678 INFO L87 Difference]: Start difference. First operand 321497 states and 454536 transitions. Second operand 13 states. [2019-09-10 06:53:41,156 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:53:41,315 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:53:41,483 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:53:41,653 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:53:41,905 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:53:42,140 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:53:43,323 WARN L188 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-09-10 06:53:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:48,394 INFO L93 Difference]: Finished difference Result 1573260 states and 2217524 transitions. [2019-09-10 06:53:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:53:48,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-10 06:53:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:00,537 INFO L225 Difference]: With dead ends: 1573260 [2019-09-10 06:54:00,537 INFO L226 Difference]: Without dead ends: 1573260 [2019-09-10 06:54:00,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:54:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573260 states. [2019-09-10 06:54:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573260 to 318832. [2019-09-10 06:54:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318832 states. [2019-09-10 06:54:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318832 states to 318832 states and 450900 transitions. [2019-09-10 06:54:10,660 INFO L78 Accepts]: Start accepts. Automaton has 318832 states and 450900 transitions. Word has length 82 [2019-09-10 06:54:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:10,660 INFO L475 AbstractCegarLoop]: Abstraction has 318832 states and 450900 transitions. [2019-09-10 06:54:10,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:54:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 318832 states and 450900 transitions. [2019-09-10 06:54:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:54:10,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:10,665 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:10,665 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -290649160, now seen corresponding path program 1 times [2019-09-10 06:54:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:10,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:11,237 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:54:11,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:11,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:54:11,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:11,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:54:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:54:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:54:11,238 INFO L87 Difference]: Start difference. First operand 318832 states and 450900 transitions. Second operand 13 states. [2019-09-10 06:54:11,662 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 06:54:11,836 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:54:12,039 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:54:12,194 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:54:12,354 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:54:12,499 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:54:12,680 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:54:12,862 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:54:13,082 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:54:13,243 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:54:14,153 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:54:14,676 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:54:15,328 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:54:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:26,161 INFO L93 Difference]: Finished difference Result 1940077 states and 2727721 transitions. [2019-09-10 06:54:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:54:26,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-10 06:54:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:30,619 INFO L225 Difference]: With dead ends: 1940077 [2019-09-10 06:54:30,619 INFO L226 Difference]: Without dead ends: 1940077 [2019-09-10 06:54:30,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:54:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940077 states. [2019-09-10 06:54:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940077 to 318716. [2019-09-10 06:54:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318716 states. [2019-09-10 06:54:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318716 states to 318716 states and 450753 transitions. [2019-09-10 06:54:51,132 INFO L78 Accepts]: Start accepts. Automaton has 318716 states and 450753 transitions. Word has length 82 [2019-09-10 06:54:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:51,132 INFO L475 AbstractCegarLoop]: Abstraction has 318716 states and 450753 transitions. [2019-09-10 06:54:51,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:54:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 318716 states and 450753 transitions. [2019-09-10 06:54:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:54:51,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:51,138 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:51,139 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1362751374, now seen corresponding path program 1 times [2019-09-10 06:54:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:51,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:51,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:51,183 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:54:51,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:51,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:51,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:51,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:51,186 INFO L87 Difference]: Start difference. First operand 318716 states and 450753 transitions. Second operand 3 states. [2019-09-10 06:54:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:53,319 INFO L93 Difference]: Finished difference Result 489847 states and 692152 transitions. [2019-09-10 06:54:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:53,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:54:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:53,957 INFO L225 Difference]: With dead ends: 489847 [2019-09-10 06:54:53,957 INFO L226 Difference]: Without dead ends: 489847 [2019-09-10 06:54:53,958 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:54:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489847 states. [2019-09-10 06:55:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489847 to 307171. [2019-09-10 06:55:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307171 states. [2019-09-10 06:55:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307171 states to 307171 states and 433968 transitions. [2019-09-10 06:55:04,776 INFO L78 Accepts]: Start accepts. Automaton has 307171 states and 433968 transitions. Word has length 83 [2019-09-10 06:55:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:04,776 INFO L475 AbstractCegarLoop]: Abstraction has 307171 states and 433968 transitions. [2019-09-10 06:55:04,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 307171 states and 433968 transitions. [2019-09-10 06:55:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:55:04,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:04,781 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:04,781 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash -16938004, now seen corresponding path program 1 times [2019-09-10 06:55:04,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:04,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:04,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:04,820 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:55:04,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:04,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:04,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:04,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:04,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:04,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:04,821 INFO L87 Difference]: Start difference. First operand 307171 states and 433968 transitions. Second operand 3 states. [2019-09-10 06:55:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:06,964 INFO L93 Difference]: Finished difference Result 481352 states and 678358 transitions. [2019-09-10 06:55:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:55:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:07,717 INFO L225 Difference]: With dead ends: 481352 [2019-09-10 06:55:07,718 INFO L226 Difference]: Without dead ends: 481352 [2019-09-10 06:55:07,718 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:55:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481352 states. [2019-09-10 06:55:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481352 to 379166. [2019-09-10 06:55:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379166 states. [2019-09-10 06:55:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379166 states to 379166 states and 536019 transitions. [2019-09-10 06:55:20,160 INFO L78 Accepts]: Start accepts. Automaton has 379166 states and 536019 transitions. Word has length 83 [2019-09-10 06:55:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:20,161 INFO L475 AbstractCegarLoop]: Abstraction has 379166 states and 536019 transitions. [2019-09-10 06:55:20,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 379166 states and 536019 transitions. [2019-09-10 06:55:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:55:20,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:20,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:20,169 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 697556452, now seen corresponding path program 1 times [2019-09-10 06:55:20,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:20,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:20,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:20,213 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:55:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:20,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:20,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:20,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:20,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:20,215 INFO L87 Difference]: Start difference. First operand 379166 states and 536019 transitions. Second operand 3 states. [2019-09-10 06:55:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:20,983 INFO L93 Difference]: Finished difference Result 362100 states and 505407 transitions. [2019-09-10 06:55:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:20,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 06:55:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:22,252 INFO L225 Difference]: With dead ends: 362100 [2019-09-10 06:55:22,252 INFO L226 Difference]: Without dead ends: 362100 [2019-09-10 06:55:22,253 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:55:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362100 states. [2019-09-10 06:55:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362100 to 362098. [2019-09-10 06:55:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362098 states. [2019-09-10 06:55:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362098 states to 362098 states and 505406 transitions. [2019-09-10 06:55:26,720 INFO L78 Accepts]: Start accepts. Automaton has 362098 states and 505406 transitions. Word has length 85 [2019-09-10 06:55:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:26,720 INFO L475 AbstractCegarLoop]: Abstraction has 362098 states and 505406 transitions. [2019-09-10 06:55:26,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 362098 states and 505406 transitions. [2019-09-10 06:55:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:55:26,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:26,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:26,727 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash -236803730, now seen corresponding path program 1 times [2019-09-10 06:55:26,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:26,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:26,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:26,769 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:55:26,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:26,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:26,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:26,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:26,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:26,770 INFO L87 Difference]: Start difference. First operand 362098 states and 505406 transitions. Second operand 3 states. [2019-09-10 06:55:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:28,620 INFO L93 Difference]: Finished difference Result 343323 states and 473234 transitions. [2019-09-10 06:55:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:28,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:55:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:29,014 INFO L225 Difference]: With dead ends: 343323 [2019-09-10 06:55:29,014 INFO L226 Difference]: Without dead ends: 343323 [2019-09-10 06:55:29,015 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:55:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343323 states. [2019-09-10 06:55:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343323 to 343321. [2019-09-10 06:55:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343321 states. [2019-09-10 06:55:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343321 states to 343321 states and 473233 transitions. [2019-09-10 06:55:37,192 INFO L78 Accepts]: Start accepts. Automaton has 343321 states and 473233 transitions. Word has length 86 [2019-09-10 06:55:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:37,192 INFO L475 AbstractCegarLoop]: Abstraction has 343321 states and 473233 transitions. [2019-09-10 06:55:37,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 343321 states and 473233 transitions. [2019-09-10 06:55:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:55:37,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:37,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:37,198 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:37,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1303605833, now seen corresponding path program 1 times [2019-09-10 06:55:37,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:37,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:37,229 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:55:37,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:37,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:37,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:37,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:37,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:37,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:37,230 INFO L87 Difference]: Start difference. First operand 343321 states and 473233 transitions. Second operand 3 states. [2019-09-10 06:55:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:39,467 INFO L93 Difference]: Finished difference Result 537746 states and 739821 transitions. [2019-09-10 06:55:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:39,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 06:55:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:40,151 INFO L225 Difference]: With dead ends: 537746 [2019-09-10 06:55:40,152 INFO L226 Difference]: Without dead ends: 537746 [2019-09-10 06:55:40,152 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:55:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537746 states. [2019-09-10 06:55:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537746 to 342999. [2019-09-10 06:55:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342999 states. [2019-09-10 06:55:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342999 states to 342999 states and 471872 transitions. [2019-09-10 06:55:45,882 INFO L78 Accepts]: Start accepts. Automaton has 342999 states and 471872 transitions. Word has length 87 [2019-09-10 06:55:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:45,883 INFO L475 AbstractCegarLoop]: Abstraction has 342999 states and 471872 transitions. [2019-09-10 06:55:45,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 342999 states and 471872 transitions. [2019-09-10 06:55:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:55:45,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:45,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:45,888 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1729618236, now seen corresponding path program 1 times [2019-09-10 06:55:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:45,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:45,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:46,830 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:55:46,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:46,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:55:46,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:46,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:55:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:55:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:55:46,831 INFO L87 Difference]: Start difference. First operand 342999 states and 471872 transitions. Second operand 19 states. [2019-09-10 06:55:47,452 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:55:47,654 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:55:47,974 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 06:55:48,258 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 06:55:48,462 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:55:48,665 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:55:49,189 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:55:49,362 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:55:49,616 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:55:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:55,223 INFO L93 Difference]: Finished difference Result 504144 states and 692437 transitions. [2019-09-10 06:55:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:55:55,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2019-09-10 06:55:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:55,894 INFO L225 Difference]: With dead ends: 504144 [2019-09-10 06:55:55,894 INFO L226 Difference]: Without dead ends: 504144 [2019-09-10 06:55:55,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:55:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504144 states. [2019-09-10 06:55:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504144 to 342971. [2019-09-10 06:55:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342971 states. [2019-09-10 06:56:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342971 states to 342971 states and 471836 transitions. [2019-09-10 06:56:01,354 INFO L78 Accepts]: Start accepts. Automaton has 342971 states and 471836 transitions. Word has length 87 [2019-09-10 06:56:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:01,354 INFO L475 AbstractCegarLoop]: Abstraction has 342971 states and 471836 transitions. [2019-09-10 06:56:01,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:56:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 342971 states and 471836 transitions. [2019-09-10 06:56:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:56:01,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:01,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:01,361 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1178699199, now seen corresponding path program 1 times [2019-09-10 06:56:01,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:01,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:01,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:01,401 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:56:01,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:01,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:01,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:01,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:01,403 INFO L87 Difference]: Start difference. First operand 342971 states and 471836 transitions. Second operand 3 states. [2019-09-10 06:56:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:02,179 INFO L93 Difference]: Finished difference Result 377495 states and 518344 transitions. [2019-09-10 06:56:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:02,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 06:56:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:02,635 INFO L225 Difference]: With dead ends: 377495 [2019-09-10 06:56:02,635 INFO L226 Difference]: Without dead ends: 377495 [2019-09-10 06:56:02,635 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:56:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377495 states. [2019-09-10 06:56:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377495 to 337131. [2019-09-10 06:56:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337131 states. [2019-09-10 06:56:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337131 states to 337131 states and 463161 transitions. [2019-09-10 06:56:11,764 INFO L78 Accepts]: Start accepts. Automaton has 337131 states and 463161 transitions. Word has length 87 [2019-09-10 06:56:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:11,764 INFO L475 AbstractCegarLoop]: Abstraction has 337131 states and 463161 transitions. [2019-09-10 06:56:11,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 337131 states and 463161 transitions. [2019-09-10 06:56:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:56:11,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:11,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:11,770 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1403901146, now seen corresponding path program 1 times [2019-09-10 06:56:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:11,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:12,555 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:56:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:56:12,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:12,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:56:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:56:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:56:12,556 INFO L87 Difference]: Start difference. First operand 337131 states and 463161 transitions. Second operand 18 states. [2019-09-10 06:56:13,221 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:56:13,424 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:56:14,667 WARN L188 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 06:56:14,846 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:56:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:21,201 INFO L93 Difference]: Finished difference Result 1320231 states and 1816723 transitions. [2019-09-10 06:56:21,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:56:21,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 88 [2019-09-10 06:56:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:23,002 INFO L225 Difference]: With dead ends: 1320231 [2019-09-10 06:56:23,002 INFO L226 Difference]: Without dead ends: 1320231 [2019-09-10 06:56:23,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:56:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320231 states. [2019-09-10 06:56:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320231 to 337145. [2019-09-10 06:56:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337145 states. [2019-09-10 06:56:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337145 states to 337145 states and 463171 transitions. [2019-09-10 06:56:40,006 INFO L78 Accepts]: Start accepts. Automaton has 337145 states and 463171 transitions. Word has length 88 [2019-09-10 06:56:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:40,006 INFO L475 AbstractCegarLoop]: Abstraction has 337145 states and 463171 transitions. [2019-09-10 06:56:40,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:56:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 337145 states and 463171 transitions. [2019-09-10 06:56:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:56:40,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:40,026 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:40,026 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 274272273, now seen corresponding path program 1 times [2019-09-10 06:56:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:40,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:40,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:40,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:40,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:40,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:40,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:40,075 INFO L87 Difference]: Start difference. First operand 337145 states and 463171 transitions. Second operand 3 states. [2019-09-10 06:56:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:42,518 INFO L93 Difference]: Finished difference Result 642717 states and 872742 transitions. [2019-09-10 06:56:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:42,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 06:56:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:43,302 INFO L225 Difference]: With dead ends: 642717 [2019-09-10 06:56:43,302 INFO L226 Difference]: Without dead ends: 635041 [2019-09-10 06:56:43,303 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:56:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635041 states. [2019-09-10 06:56:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635041 to 597729. [2019-09-10 06:56:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597729 states. [2019-09-10 06:57:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597729 states to 597729 states and 816081 transitions. [2019-09-10 06:57:04,160 INFO L78 Accepts]: Start accepts. Automaton has 597729 states and 816081 transitions. Word has length 96 [2019-09-10 06:57:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:04,160 INFO L475 AbstractCegarLoop]: Abstraction has 597729 states and 816081 transitions. [2019-09-10 06:57:04,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 597729 states and 816081 transitions. [2019-09-10 06:57:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:57:04,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:04,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:04,181 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -102128551, now seen corresponding path program 1 times [2019-09-10 06:57:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:04,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:04,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:04,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:04,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:04,226 INFO L87 Difference]: Start difference. First operand 597729 states and 816081 transitions. Second operand 3 states. [2019-09-10 06:57:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:07,249 INFO L93 Difference]: Finished difference Result 1113381 states and 1500945 transitions. [2019-09-10 06:57:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:07,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:57:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:10,254 INFO L225 Difference]: With dead ends: 1113381 [2019-09-10 06:57:10,255 INFO L226 Difference]: Without dead ends: 1094139 [2019-09-10 06:57:10,255 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:57:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094139 states. [2019-09-10 06:57:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094139 to 1009715. [2019-09-10 06:57:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009715 states. [2019-09-10 06:57:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009715 states to 1009715 states and 1371272 transitions. [2019-09-10 06:57:39,624 INFO L78 Accepts]: Start accepts. Automaton has 1009715 states and 1371272 transitions. Word has length 97 [2019-09-10 06:57:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:39,625 INFO L475 AbstractCegarLoop]: Abstraction has 1009715 states and 1371272 transitions. [2019-09-10 06:57:39,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1009715 states and 1371272 transitions. [2019-09-10 06:57:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:57:39,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:39,640 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:39,640 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 958556122, now seen corresponding path program 1 times [2019-09-10 06:57:39,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:39,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:39,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:39,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:39,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:39,684 INFO L87 Difference]: Start difference. First operand 1009715 states and 1371272 transitions. Second operand 3 states. [2019-09-10 06:57:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:46,356 INFO L93 Difference]: Finished difference Result 1918662 states and 2550558 transitions. [2019-09-10 06:57:46,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:46,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:57:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:50,682 INFO L225 Difference]: With dead ends: 1918662 [2019-09-10 06:57:50,682 INFO L226 Difference]: Without dead ends: 1918662 [2019-09-10 06:57:50,683 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:57:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918662 states.