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/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:30:57,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:30:57,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:30:57,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:30:57,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:30:57,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:30:57,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:30:57,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:30:57,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:30:57,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:30:57,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:30:57,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:30:57,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:30:57,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:30:57,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:30:57,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:30:57,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:30:57,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:30:57,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:30:57,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:30:57,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:30:57,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:30:57,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:30:57,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:30:57,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:30:57,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:30:57,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:30:57,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:30:57,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:30:57,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:30:57,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:30:57,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:30:57,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:30:57,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:30:57,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:30:57,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:30:57,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:30:57,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:30:57,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:30:57,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:30:57,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:30:57,185 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-10-03 02:30:57,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:30:57,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:30:57,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:30:57,215 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:30:57,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:30:57,216 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:30:57,216 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:30:57,216 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:30:57,216 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:30:57,216 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:30:57,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:30:57,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:30:57,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:30:57,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:30:57,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:30:57,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:30:57,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:30:57,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:30:57,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:30:57,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:30:57,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:30:57,221 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:30:57,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:30:57,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:30:57,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:30:57,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:30:57,223 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:30:57,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:30:57,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:30:57,223 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:30:57,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:30:57,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:30:57,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:30:57,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:30:57,296 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:30:57,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-03 02:30:57,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2166324/19582400ff53493e96d623ea700af687/FLAG5b4c56c29 [2019-10-03 02:30:57,824 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:30:57,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-03 02:30:57,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2166324/19582400ff53493e96d623ea700af687/FLAG5b4c56c29 [2019-10-03 02:30:58,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2166324/19582400ff53493e96d623ea700af687 [2019-10-03 02:30:58,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:30:58,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:30:58,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:58,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:30:58,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:30:58,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ed2c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58, skipping insertion in model container [2019-10-03 02:30:58,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:30:58,274 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:30:58,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:58,491 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:30:58,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:58,639 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:30:58,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58 WrapperNode [2019-10-03 02:30:58,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:58,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:30:58,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:30:58,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:30:58,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (1/1) ... [2019-10-03 02:30:58,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:30:58,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:30:58,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:30:58,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:30:58,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (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-10-03 02:30:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:30:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:30:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:30:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:30:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:30:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:30:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:30:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:30:59,190 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:30:59,191 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:30:59,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:59 BoogieIcfgContainer [2019-10-03 02:30:59,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:30:59,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:30:59,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:30:59,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:30:59,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:30:58" (1/3) ... [2019-10-03 02:30:59,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16496c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:59, skipping insertion in model container [2019-10-03 02:30:59,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:58" (2/3) ... [2019-10-03 02:30:59,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16496c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:59, skipping insertion in model container [2019-10-03 02:30:59,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:59" (3/3) ... [2019-10-03 02:30:59,201 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-10-03 02:30:59,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:30:59,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:30:59,240 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:30:59,269 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:30:59,270 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:30:59,270 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:30:59,270 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:30:59,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:30:59,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:30:59,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:30:59,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:30:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-03 02:30:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:59,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:59,300 INFO L411 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] [2019-10-03 02:30:59,303 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-03 02:30:59,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:59,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:59,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:59,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:59,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:59,550 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-03 02:30:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:59,629 INFO L93 Difference]: Finished difference Result 110 states and 197 transitions. [2019-10-03 02:30:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:59,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:59,653 INFO L225 Difference]: With dead ends: 110 [2019-10-03 02:30:59,653 INFO L226 Difference]: Without dead ends: 102 [2019-10-03 02:30:59,657 INFO L640 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-10-03 02:30:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-03 02:30:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2019-10-03 02:30:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:30:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2019-10-03 02:30:59,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2019-10-03 02:30:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2019-10-03 02:30:59,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2019-10-03 02:30:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:59,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:59,722 INFO L411 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] [2019-10-03 02:30:59,722 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-03 02:30:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:59,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:59,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:59,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:59,822 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2019-10-03 02:30:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:59,864 INFO L93 Difference]: Finished difference Result 102 states and 186 transitions. [2019-10-03 02:30:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:59,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:59,869 INFO L225 Difference]: With dead ends: 102 [2019-10-03 02:30:59,869 INFO L226 Difference]: Without dead ends: 102 [2019-10-03 02:30:59,870 INFO L640 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-10-03 02:30:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-03 02:30:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-03 02:30:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-03 02:30:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2019-10-03 02:30:59,899 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2019-10-03 02:30:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:59,900 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2019-10-03 02:30:59,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2019-10-03 02:30:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:59,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:59,902 INFO L411 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] [2019-10-03 02:30:59,903 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2019-10-03 02:30:59,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,025 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2019-10-03 02:31:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,058 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2019-10-03 02:31:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,061 INFO L225 Difference]: With dead ends: 105 [2019-10-03 02:31:00,061 INFO L226 Difference]: Without dead ends: 105 [2019-10-03 02:31:00,062 INFO L640 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-10-03 02:31:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-03 02:31:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-03 02:31:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-03 02:31:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2019-10-03 02:31:00,071 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2019-10-03 02:31:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,072 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2019-10-03 02:31:00,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2019-10-03 02:31:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:31:00,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,073 INFO L411 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] [2019-10-03 02:31:00,074 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2019-10-03 02:31:00,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,130 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2019-10-03 02:31:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,157 INFO L93 Difference]: Finished difference Result 194 states and 357 transitions. [2019-10-03 02:31:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,161 INFO L225 Difference]: With dead ends: 194 [2019-10-03 02:31:00,161 INFO L226 Difference]: Without dead ends: 194 [2019-10-03 02:31:00,162 INFO L640 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-10-03 02:31:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-03 02:31:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2019-10-03 02:31:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-03 02:31:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2019-10-03 02:31:00,173 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2019-10-03 02:31:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,174 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2019-10-03 02:31:00,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2019-10-03 02:31:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:31:00,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,176 INFO L411 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] [2019-10-03 02:31:00,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2019-10-03 02:31:00,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,260 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2019-10-03 02:31:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,280 INFO L93 Difference]: Finished difference Result 196 states and 355 transitions. [2019-10-03 02:31:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,282 INFO L225 Difference]: With dead ends: 196 [2019-10-03 02:31:00,282 INFO L226 Difference]: Without dead ends: 196 [2019-10-03 02:31:00,283 INFO L640 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-10-03 02:31:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-03 02:31:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-10-03 02:31:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-03 02:31:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2019-10-03 02:31:00,294 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2019-10-03 02:31:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,295 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2019-10-03 02:31:00,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2019-10-03 02:31:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:31:00,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,297 INFO L411 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] [2019-10-03 02:31:00,297 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2019-10-03 02:31:00,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,343 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2019-10-03 02:31:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,361 INFO L93 Difference]: Finished difference Result 198 states and 355 transitions. [2019-10-03 02:31:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:31:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,375 INFO L225 Difference]: With dead ends: 198 [2019-10-03 02:31:00,375 INFO L226 Difference]: Without dead ends: 198 [2019-10-03 02:31:00,375 INFO L640 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-10-03 02:31:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-03 02:31:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-03 02:31:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-03 02:31:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2019-10-03 02:31:00,386 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2019-10-03 02:31:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,387 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2019-10-03 02:31:00,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2019-10-03 02:31:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:31:00,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,389 INFO L411 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] [2019-10-03 02:31:00,389 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2019-10-03 02:31:00,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,437 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2019-10-03 02:31:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,464 INFO L93 Difference]: Finished difference Result 370 states and 675 transitions. [2019-10-03 02:31:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:31:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,467 INFO L225 Difference]: With dead ends: 370 [2019-10-03 02:31:00,468 INFO L226 Difference]: Without dead ends: 370 [2019-10-03 02:31:00,468 INFO L640 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-10-03 02:31:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-03 02:31:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2019-10-03 02:31:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-03 02:31:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2019-10-03 02:31:00,486 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2019-10-03 02:31:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,486 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2019-10-03 02:31:00,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2019-10-03 02:31:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:31:00,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,496 INFO L411 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] [2019-10-03 02:31:00,497 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2019-10-03 02:31:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,551 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2019-10-03 02:31:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,579 INFO L93 Difference]: Finished difference Result 378 states and 675 transitions. [2019-10-03 02:31:00,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:31:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,584 INFO L225 Difference]: With dead ends: 378 [2019-10-03 02:31:00,584 INFO L226 Difference]: Without dead ends: 378 [2019-10-03 02:31:00,585 INFO L640 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-10-03 02:31:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-03 02:31:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-10-03 02:31:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-03 02:31:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2019-10-03 02:31:00,598 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2019-10-03 02:31:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,598 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2019-10-03 02:31:00,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2019-10-03 02:31:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:31:00,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,601 INFO L411 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] [2019-10-03 02:31:00,602 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2019-10-03 02:31:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,667 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2019-10-03 02:31:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,686 INFO L93 Difference]: Finished difference Result 382 states and 675 transitions. [2019-10-03 02:31:00,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:31:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,691 INFO L225 Difference]: With dead ends: 382 [2019-10-03 02:31:00,691 INFO L226 Difference]: Without dead ends: 382 [2019-10-03 02:31:00,692 INFO L640 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-10-03 02:31:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-03 02:31:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-10-03 02:31:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-03 02:31:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2019-10-03 02:31:00,704 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2019-10-03 02:31:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,704 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2019-10-03 02:31:00,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2019-10-03 02:31:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:31:00,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,709 INFO L411 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] [2019-10-03 02:31:00,710 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2019-10-03 02:31:00,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,759 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2019-10-03 02:31:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,780 INFO L93 Difference]: Finished difference Result 714 states and 1279 transitions. [2019-10-03 02:31:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:31:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,785 INFO L225 Difference]: With dead ends: 714 [2019-10-03 02:31:00,785 INFO L226 Difference]: Without dead ends: 714 [2019-10-03 02:31:00,785 INFO L640 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-10-03 02:31:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-03 02:31:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2019-10-03 02:31:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-03 02:31:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2019-10-03 02:31:00,806 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2019-10-03 02:31:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,809 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2019-10-03 02:31:00,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2019-10-03 02:31:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:31:00,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,812 INFO L411 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] [2019-10-03 02:31:00,812 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2019-10-03 02:31:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,855 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2019-10-03 02:31:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,880 INFO L93 Difference]: Finished difference Result 738 states and 1287 transitions. [2019-10-03 02:31:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:31:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,886 INFO L225 Difference]: With dead ends: 738 [2019-10-03 02:31:00,887 INFO L226 Difference]: Without dead ends: 738 [2019-10-03 02:31:00,887 INFO L640 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-10-03 02:31:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-03 02:31:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2019-10-03 02:31:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-03 02:31:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2019-10-03 02:31:00,906 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2019-10-03 02:31:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,906 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2019-10-03 02:31:00,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2019-10-03 02:31:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:31:00,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,908 INFO L411 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] [2019-10-03 02:31:00,908 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2019-10-03 02:31:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,956 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2019-10-03 02:31:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,974 INFO L93 Difference]: Finished difference Result 746 states and 1287 transitions. [2019-10-03 02:31:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:31:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,979 INFO L225 Difference]: With dead ends: 746 [2019-10-03 02:31:00,979 INFO L226 Difference]: Without dead ends: 746 [2019-10-03 02:31:00,980 INFO L640 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-10-03 02:31:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-03 02:31:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2019-10-03 02:31:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-10-03 02:31:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2019-10-03 02:31:00,999 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2019-10-03 02:31:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,999 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2019-10-03 02:31:00,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2019-10-03 02:31:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:31:01,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,001 INFO L411 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] [2019-10-03 02:31:01,001 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2019-10-03 02:31:01,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,029 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2019-10-03 02:31:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,051 INFO L93 Difference]: Finished difference Result 1386 states and 2423 transitions. [2019-10-03 02:31:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:31:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,059 INFO L225 Difference]: With dead ends: 1386 [2019-10-03 02:31:01,059 INFO L226 Difference]: Without dead ends: 1386 [2019-10-03 02:31:01,059 INFO L640 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-10-03 02:31:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-03 02:31:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2019-10-03 02:31:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-03 02:31:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2019-10-03 02:31:01,087 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2019-10-03 02:31:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,087 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2019-10-03 02:31:01,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2019-10-03 02:31:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:31:01,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,090 INFO L411 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] [2019-10-03 02:31:01,091 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2019-10-03 02:31:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,125 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2019-10-03 02:31:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,151 INFO L93 Difference]: Finished difference Result 1450 states and 2455 transitions. [2019-10-03 02:31:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:31:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,160 INFO L225 Difference]: With dead ends: 1450 [2019-10-03 02:31:01,160 INFO L226 Difference]: Without dead ends: 1450 [2019-10-03 02:31:01,161 INFO L640 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-10-03 02:31:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-03 02:31:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2019-10-03 02:31:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-10-03 02:31:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2019-10-03 02:31:01,200 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2019-10-03 02:31:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,201 INFO L475 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2019-10-03 02:31:01,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2019-10-03 02:31:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:31:01,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,204 INFO L411 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] [2019-10-03 02:31:01,204 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2019-10-03 02:31:01,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,246 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2019-10-03 02:31:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,276 INFO L93 Difference]: Finished difference Result 1466 states and 2455 transitions. [2019-10-03 02:31:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:31:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,284 INFO L225 Difference]: With dead ends: 1466 [2019-10-03 02:31:01,284 INFO L226 Difference]: Without dead ends: 1466 [2019-10-03 02:31:01,286 INFO L640 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-10-03 02:31:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-03 02:31:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2019-10-03 02:31:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-03 02:31:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2019-10-03 02:31:01,318 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2019-10-03 02:31:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,319 INFO L475 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2019-10-03 02:31:01,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2019-10-03 02:31:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:31:01,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,321 INFO L411 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] [2019-10-03 02:31:01,321 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,322 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2019-10-03 02:31:01,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,353 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2019-10-03 02:31:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,386 INFO L93 Difference]: Finished difference Result 2698 states and 4583 transitions. [2019-10-03 02:31:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:31:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,400 INFO L225 Difference]: With dead ends: 2698 [2019-10-03 02:31:01,400 INFO L226 Difference]: Without dead ends: 2698 [2019-10-03 02:31:01,400 INFO L640 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-10-03 02:31:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-03 02:31:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2019-10-03 02:31:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-03 02:31:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2019-10-03 02:31:01,452 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2019-10-03 02:31:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,453 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2019-10-03 02:31:01,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2019-10-03 02:31:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:31:01,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,457 INFO L411 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] [2019-10-03 02:31:01,457 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2019-10-03 02:31:01,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,494 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2019-10-03 02:31:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,526 INFO L93 Difference]: Finished difference Result 2858 states and 4679 transitions. [2019-10-03 02:31:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:31:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,541 INFO L225 Difference]: With dead ends: 2858 [2019-10-03 02:31:01,541 INFO L226 Difference]: Without dead ends: 2858 [2019-10-03 02:31:01,542 INFO L640 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-10-03 02:31:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-03 02:31:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2019-10-03 02:31:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-10-03 02:31:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2019-10-03 02:31:01,629 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2019-10-03 02:31:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,630 INFO L475 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2019-10-03 02:31:01,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2019-10-03 02:31:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:31:01,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,636 INFO L411 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] [2019-10-03 02:31:01,636 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2019-10-03 02:31:01,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,665 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2019-10-03 02:31:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,712 INFO L93 Difference]: Finished difference Result 2890 states and 4679 transitions. [2019-10-03 02:31:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:31:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,732 INFO L225 Difference]: With dead ends: 2890 [2019-10-03 02:31:01,732 INFO L226 Difference]: Without dead ends: 2890 [2019-10-03 02:31:01,733 INFO L640 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-10-03 02:31:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-10-03 02:31:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2019-10-03 02:31:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2019-10-03 02:31:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2019-10-03 02:31:01,831 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2019-10-03 02:31:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,831 INFO L475 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2019-10-03 02:31:01,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2019-10-03 02:31:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:31:01,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,836 INFO L411 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] [2019-10-03 02:31:01,836 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2019-10-03 02:31:01,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,868 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2019-10-03 02:31:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,930 INFO L93 Difference]: Finished difference Result 5258 states and 8647 transitions. [2019-10-03 02:31:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:31:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,965 INFO L225 Difference]: With dead ends: 5258 [2019-10-03 02:31:01,965 INFO L226 Difference]: Without dead ends: 5258 [2019-10-03 02:31:01,966 INFO L640 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-10-03 02:31:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-03 02:31:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2019-10-03 02:31:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-03 02:31:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2019-10-03 02:31:02,123 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2019-10-03 02:31:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,123 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2019-10-03 02:31:02,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2019-10-03 02:31:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:31:02,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,132 INFO L411 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] [2019-10-03 02:31:02,133 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2019-10-03 02:31:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,162 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2019-10-03 02:31:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,205 INFO L93 Difference]: Finished difference Result 5642 states and 8903 transitions. [2019-10-03 02:31:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:31:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,245 INFO L225 Difference]: With dead ends: 5642 [2019-10-03 02:31:02,245 INFO L226 Difference]: Without dead ends: 5642 [2019-10-03 02:31:02,247 INFO L640 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-10-03 02:31:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-10-03 02:31:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2019-10-03 02:31:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2019-10-03 02:31:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2019-10-03 02:31:02,378 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2019-10-03 02:31:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,379 INFO L475 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2019-10-03 02:31:02,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2019-10-03 02:31:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:31:02,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,387 INFO L411 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] [2019-10-03 02:31:02,387 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2019-10-03 02:31:02,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,417 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2019-10-03 02:31:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,465 INFO L93 Difference]: Finished difference Result 5706 states and 8903 transitions. [2019-10-03 02:31:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:31:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,490 INFO L225 Difference]: With dead ends: 5706 [2019-10-03 02:31:02,490 INFO L226 Difference]: Without dead ends: 5706 [2019-10-03 02:31:02,491 INFO L640 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-10-03 02:31:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-10-03 02:31:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2019-10-03 02:31:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-10-03 02:31:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2019-10-03 02:31:02,618 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2019-10-03 02:31:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,618 INFO L475 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2019-10-03 02:31:02,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2019-10-03 02:31:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:31:02,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,675 INFO L411 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] [2019-10-03 02:31:02,676 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2019-10-03 02:31:02,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,707 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2019-10-03 02:31:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,757 INFO L93 Difference]: Finished difference Result 11146 states and 17031 transitions. [2019-10-03 02:31:02,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:31:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,783 INFO L225 Difference]: With dead ends: 11146 [2019-10-03 02:31:02,783 INFO L226 Difference]: Without dead ends: 11146 [2019-10-03 02:31:02,784 INFO L640 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-10-03 02:31:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-03 02:31:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2019-10-03 02:31:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-03 02:31:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2019-10-03 02:31:02,979 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2019-10-03 02:31:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,980 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2019-10-03 02:31:02,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2019-10-03 02:31:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:31:02,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,993 INFO L411 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] [2019-10-03 02:31:02,993 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2019-10-03 02:31:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:03,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:03,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:03,020 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2019-10-03 02:31:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:03,070 INFO L93 Difference]: Finished difference Result 13194 states and 20743 transitions. [2019-10-03 02:31:03,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:03,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:31:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:03,101 INFO L225 Difference]: With dead ends: 13194 [2019-10-03 02:31:03,102 INFO L226 Difference]: Without dead ends: 13194 [2019-10-03 02:31:03,103 INFO L640 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-10-03 02:31:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2019-10-03 02:31:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2019-10-03 02:31:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-03 02:31:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2019-10-03 02:31:03,422 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2019-10-03 02:31:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:03,422 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2019-10-03 02:31:03,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2019-10-03 02:31:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:31:03,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:03,437 INFO L411 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] [2019-10-03 02:31:03,438 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2019-10-03 02:31:03,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:03,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:03,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:03,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:03,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:03,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:03,471 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2019-10-03 02:31:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:03,542 INFO L93 Difference]: Finished difference Result 19850 states and 30599 transitions. [2019-10-03 02:31:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:03,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:31:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:03,588 INFO L225 Difference]: With dead ends: 19850 [2019-10-03 02:31:03,589 INFO L226 Difference]: Without dead ends: 19850 [2019-10-03 02:31:03,593 INFO L640 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-10-03 02:31:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2019-10-03 02:31:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2019-10-03 02:31:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2019-10-03 02:31:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2019-10-03 02:31:03,925 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2019-10-03 02:31:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:03,926 INFO L475 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2019-10-03 02:31:03,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2019-10-03 02:31:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:31:03,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:03,953 INFO L411 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] [2019-10-03 02:31:03,953 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2019-10-03 02:31:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:03,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:03,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:04,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:04,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:04,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:04,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:04,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:04,098 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2019-10-03 02:31:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:04,179 INFO L93 Difference]: Finished difference Result 21898 states and 32263 transitions. [2019-10-03 02:31:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:04,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:31:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:04,222 INFO L225 Difference]: With dead ends: 21898 [2019-10-03 02:31:04,223 INFO L226 Difference]: Without dead ends: 21898 [2019-10-03 02:31:04,223 INFO L640 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-10-03 02:31:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-10-03 02:31:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2019-10-03 02:31:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-10-03 02:31:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2019-10-03 02:31:04,531 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2019-10-03 02:31:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:04,531 INFO L475 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2019-10-03 02:31:04,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2019-10-03 02:31:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:04,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:04,557 INFO L411 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] [2019-10-03 02:31:04,557 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:04,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2019-10-03 02:31:04,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:04,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:04,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:04,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:04,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:04,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:04,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:04,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:04,581 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2019-10-03 02:31:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:04,652 INFO L93 Difference]: Finished difference Result 22282 states and 32519 transitions. [2019-10-03 02:31:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:04,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:04,697 INFO L225 Difference]: With dead ends: 22282 [2019-10-03 02:31:04,697 INFO L226 Difference]: Without dead ends: 22282 [2019-10-03 02:31:04,697 INFO L640 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-10-03 02:31:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2019-10-03 02:31:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2019-10-03 02:31:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2019-10-03 02:31:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2019-10-03 02:31:05,515 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2019-10-03 02:31:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:05,515 INFO L475 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2019-10-03 02:31:05,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2019-10-03 02:31:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:05,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:05,539 INFO L411 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] [2019-10-03 02:31:05,540 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2019-10-03 02:31:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:05,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:05,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:05,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:05,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:05,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:05,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:05,565 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2019-10-03 02:31:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:05,657 INFO L93 Difference]: Finished difference Result 38922 states and 57607 transitions. [2019-10-03 02:31:05,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:05,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:05,735 INFO L225 Difference]: With dead ends: 38922 [2019-10-03 02:31:05,735 INFO L226 Difference]: Without dead ends: 38922 [2019-10-03 02:31:05,735 INFO L640 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-10-03 02:31:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2019-10-03 02:31:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2019-10-03 02:31:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2019-10-03 02:31:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2019-10-03 02:31:06,359 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2019-10-03 02:31:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:06,360 INFO L475 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2019-10-03 02:31:06,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2019-10-03 02:31:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:06,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:06,405 INFO L411 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] [2019-10-03 02:31:06,405 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2019-10-03 02:31:06,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:06,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:06,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:06,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:06,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:06,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:06,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:06,454 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2019-10-03 02:31:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:06,565 INFO L93 Difference]: Finished difference Result 43530 states and 61447 transitions. [2019-10-03 02:31:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:06,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:06,654 INFO L225 Difference]: With dead ends: 43530 [2019-10-03 02:31:06,654 INFO L226 Difference]: Without dead ends: 43530 [2019-10-03 02:31:06,654 INFO L640 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-10-03 02:31:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2019-10-03 02:31:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2019-10-03 02:31:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2019-10-03 02:31:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2019-10-03 02:31:07,974 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2019-10-03 02:31:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:07,974 INFO L475 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2019-10-03 02:31:07,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2019-10-03 02:31:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:07,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:07,999 INFO L411 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] [2019-10-03 02:31:07,999 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2019-10-03 02:31:08,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,030 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2019-10-03 02:31:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,146 INFO L93 Difference]: Finished difference Result 44042 states and 61447 transitions. [2019-10-03 02:31:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,203 INFO L225 Difference]: With dead ends: 44042 [2019-10-03 02:31:08,204 INFO L226 Difference]: Without dead ends: 44042 [2019-10-03 02:31:08,206 INFO L640 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-10-03 02:31:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2019-10-03 02:31:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2019-10-03 02:31:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2019-10-03 02:31:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2019-10-03 02:31:08,924 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2019-10-03 02:31:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,925 INFO L475 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2019-10-03 02:31:08,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2019-10-03 02:31:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:08,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,946 INFO L411 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] [2019-10-03 02:31:08,947 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2019-10-03 02:31:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,978 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2019-10-03 02:31:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,152 INFO L93 Difference]: Finished difference Result 75786 states and 107015 transitions. [2019-10-03 02:31:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,241 INFO L225 Difference]: With dead ends: 75786 [2019-10-03 02:31:09,242 INFO L226 Difference]: Without dead ends: 75786 [2019-10-03 02:31:09,243 INFO L640 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-10-03 02:31:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2019-10-03 02:31:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2019-10-03 02:31:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2019-10-03 02:31:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2019-10-03 02:31:10,174 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2019-10-03 02:31:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,174 INFO L475 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2019-10-03 02:31:10,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2019-10-03 02:31:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:10,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:10,211 INFO L411 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] [2019-10-03 02:31:10,212 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2019-10-03 02:31:10,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:10,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:10,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:10,240 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2019-10-03 02:31:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:10,434 INFO L93 Difference]: Finished difference Result 86026 states and 115719 transitions. [2019-10-03 02:31:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:10,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:10,501 INFO L225 Difference]: With dead ends: 86026 [2019-10-03 02:31:10,501 INFO L226 Difference]: Without dead ends: 86026 [2019-10-03 02:31:10,501 INFO L640 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-10-03 02:31:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2019-10-03 02:31:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2019-10-03 02:31:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2019-10-03 02:31:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2019-10-03 02:31:11,550 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2019-10-03 02:31:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:11,551 INFO L475 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2019-10-03 02:31:11,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2019-10-03 02:31:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:31:11,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:11,597 INFO L411 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] [2019-10-03 02:31:11,597 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2019-10-03 02:31:11,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:11,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:11,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:11,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:11,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:11,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:11,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:11,616 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2019-10-03 02:31:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:12,173 INFO L93 Difference]: Finished difference Result 87050 states and 115719 transitions. [2019-10-03 02:31:12,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:12,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:31:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:12,247 INFO L225 Difference]: With dead ends: 87050 [2019-10-03 02:31:12,247 INFO L226 Difference]: Without dead ends: 87050 [2019-10-03 02:31:12,248 INFO L640 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-10-03 02:31:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2019-10-03 02:31:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2019-10-03 02:31:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2019-10-03 02:31:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2019-10-03 02:31:12,952 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2019-10-03 02:31:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:12,953 INFO L475 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2019-10-03 02:31:12,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2019-10-03 02:31:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:31:14,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:14,816 INFO L411 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] [2019-10-03 02:31:14,816 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2019-10-03 02:31:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:14,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:14,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:14,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:14,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:14,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:14,838 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2019-10-03 02:31:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:15,108 INFO L93 Difference]: Finished difference Result 147466 states and 197639 transitions. [2019-10-03 02:31:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:15,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:31:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:15,247 INFO L225 Difference]: With dead ends: 147466 [2019-10-03 02:31:15,247 INFO L226 Difference]: Without dead ends: 147466 [2019-10-03 02:31:15,248 INFO L640 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-10-03 02:31:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-03 02:31:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2019-10-03 02:31:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2019-10-03 02:31:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2019-10-03 02:31:16,468 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2019-10-03 02:31:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:16,468 INFO L475 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2019-10-03 02:31:16,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2019-10-03 02:31:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:31:16,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:16,529 INFO L411 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] [2019-10-03 02:31:16,529 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2019-10-03 02:31:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:16,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:16,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:16,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:16,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:16,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:16,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:16,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:16,546 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2019-10-03 02:31:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:16,874 INFO L93 Difference]: Finished difference Result 169994 states and 217095 transitions. [2019-10-03 02:31:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:16,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:31:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:17,038 INFO L225 Difference]: With dead ends: 169994 [2019-10-03 02:31:17,038 INFO L226 Difference]: Without dead ends: 169994 [2019-10-03 02:31:17,039 INFO L640 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-10-03 02:31:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2019-10-03 02:31:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2019-10-03 02:31:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2019-10-03 02:31:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2019-10-03 02:31:20,659 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2019-10-03 02:31:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:20,659 INFO L475 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2019-10-03 02:31:20,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2019-10-03 02:31:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 02:31:20,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:20,720 INFO L411 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] [2019-10-03 02:31:20,720 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2019-10-03 02:31:20,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:20,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:20,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:20,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:20,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:20,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:20,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:20,740 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2019-10-03 02:31:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:21,687 INFO L93 Difference]: Finished difference Result 172042 states and 217095 transitions. [2019-10-03 02:31:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:21,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-03 02:31:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:21,827 INFO L225 Difference]: With dead ends: 172042 [2019-10-03 02:31:21,827 INFO L226 Difference]: Without dead ends: 172042 [2019-10-03 02:31:21,828 INFO L640 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-10-03 02:31:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2019-10-03 02:31:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2019-10-03 02:31:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2019-10-03 02:31:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2019-10-03 02:31:26,431 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2019-10-03 02:31:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:26,431 INFO L475 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2019-10-03 02:31:26,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2019-10-03 02:31:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 02:31:26,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:26,504 INFO L411 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] [2019-10-03 02:31:26,505 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2019-10-03 02:31:26,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:26,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:26,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:26,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:26,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:26,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:26,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:26,535 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2019-10-03 02:31:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:27,215 INFO L93 Difference]: Finished difference Result 286730 states and 362503 transitions. [2019-10-03 02:31:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:27,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-03 02:31:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:27,562 INFO L225 Difference]: With dead ends: 286730 [2019-10-03 02:31:27,562 INFO L226 Difference]: Without dead ends: 286730 [2019-10-03 02:31:27,562 INFO L640 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-10-03 02:31:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2019-10-03 02:31:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2019-10-03 02:31:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2019-10-03 02:31:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2019-10-03 02:31:30,219 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2019-10-03 02:31:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:30,219 INFO L475 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2019-10-03 02:31:30,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2019-10-03 02:31:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 02:31:34,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:34,132 INFO L411 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] [2019-10-03 02:31:34,133 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2019-10-03 02:31:34,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:34,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:34,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:34,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:34,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:34,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:34,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:34,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:34,159 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2019-10-03 02:31:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:34,767 INFO L93 Difference]: Finished difference Result 335882 states and 405511 transitions. [2019-10-03 02:31:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:34,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-03 02:31:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:35,089 INFO L225 Difference]: With dead ends: 335882 [2019-10-03 02:31:35,090 INFO L226 Difference]: Without dead ends: 335882 [2019-10-03 02:31:35,090 INFO L640 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-10-03 02:31:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2019-10-03 02:31:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2019-10-03 02:31:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2019-10-03 02:31:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2019-10-03 02:31:37,979 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2019-10-03 02:31:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:37,979 INFO L475 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2019-10-03 02:31:37,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2019-10-03 02:31:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:31:38,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:38,116 INFO L411 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] [2019-10-03 02:31:38,117 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2019-10-03 02:31:38,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:38,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:38,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:38,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:38,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:38,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:38,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:38,970 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2019-10-03 02:31:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:39,633 INFO L93 Difference]: Finished difference Result 339978 states and 405511 transitions. [2019-10-03 02:31:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:39,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:31:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:39,972 INFO L225 Difference]: With dead ends: 339978 [2019-10-03 02:31:39,972 INFO L226 Difference]: Without dead ends: 339978 [2019-10-03 02:31:39,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2019-10-03 02:31:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2019-10-03 02:31:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2019-10-03 02:31:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2019-10-03 02:31:47,520 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2019-10-03 02:31:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:47,520 INFO L475 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2019-10-03 02:31:47,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2019-10-03 02:31:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:31:47,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:47,665 INFO L411 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] [2019-10-03 02:31:47,665 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2019-10-03 02:31:47,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:47,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:47,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:47,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:47,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:47,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:47,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:47,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:47,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:47,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:47,683 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2019-10-03 02:31:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:49,302 INFO L93 Difference]: Finished difference Result 557066 states and 659463 transitions. [2019-10-03 02:31:49,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:49,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:31:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:49,893 INFO L225 Difference]: With dead ends: 557066 [2019-10-03 02:31:49,893 INFO L226 Difference]: Without dead ends: 557066 [2019-10-03 02:31:49,894 INFO L640 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-10-03 02:31:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2019-10-03 02:31:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2019-10-03 02:31:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2019-10-03 02:32:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2019-10-03 02:32:00,909 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2019-10-03 02:32:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:00,909 INFO L475 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2019-10-03 02:32:00,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2019-10-03 02:32:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:32:01,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:01,215 INFO L411 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] [2019-10-03 02:32:01,216 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2019-10-03 02:32:01,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:01,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:01,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:01,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:01,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:01,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:01,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:01,231 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2019-10-03 02:32:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:02,568 INFO L93 Difference]: Finished difference Result 663562 states and 753671 transitions. [2019-10-03 02:32:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:02,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:32:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:03,182 INFO L225 Difference]: With dead ends: 663562 [2019-10-03 02:32:03,182 INFO L226 Difference]: Without dead ends: 663562 [2019-10-03 02:32:03,182 INFO L640 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-10-03 02:32:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2019-10-03 02:32:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2019-10-03 02:32:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2019-10-03 02:32:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2019-10-03 02:32:17,954 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2019-10-03 02:32:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:17,954 INFO L475 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2019-10-03 02:32:17,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2019-10-03 02:32:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:32:18,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:18,300 INFO L411 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] [2019-10-03 02:32:18,300 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2019-10-03 02:32:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:18,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:18,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:18,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:18,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:18,318 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2019-10-03 02:32:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:26,761 INFO L93 Difference]: Finished difference Result 671754 states and 753671 transitions. [2019-10-03 02:32:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:26,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:32:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:27,437 INFO L225 Difference]: With dead ends: 671754 [2019-10-03 02:32:27,437 INFO L226 Difference]: Without dead ends: 671754 [2019-10-03 02:32:27,438 INFO L640 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-10-03 02:32:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2019-10-03 02:32:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2019-10-03 02:32:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2019-10-03 02:32:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2019-10-03 02:32:38,799 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2019-10-03 02:32:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,800 INFO L475 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2019-10-03 02:32:38,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2019-10-03 02:32:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:32:39,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,117 INFO L411 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] [2019-10-03 02:32:39,117 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2019-10-03 02:32:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:39,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:39,135 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2019-10-03 02:32:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,874 INFO L93 Difference]: Finished difference Result 1081352 states and 1187846 transitions. [2019-10-03 02:32:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:47,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:32:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,996 INFO L225 Difference]: With dead ends: 1081352 [2019-10-03 02:32:48,996 INFO L226 Difference]: Without dead ends: 1081352 [2019-10-03 02:32:48,996 INFO L640 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-10-03 02:32:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2019-10-03 02:33:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2019-10-03 02:33:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2019-10-03 02:33:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2019-10-03 02:33:18,075 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2019-10-03 02:33:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:18,076 INFO L475 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2019-10-03 02:33:18,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2019-10-03 02:33:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:33:18,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:18,727 INFO L411 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] [2019-10-03 02:33:18,727 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2019-10-03 02:33:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:18,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:33:18,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:18,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:33:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:33:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:18,746 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2019-10-03 02:33:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:28,791 INFO L93 Difference]: Finished difference Result 1310726 states and 1392645 transitions. [2019-10-03 02:33:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:33:28,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:33:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:28,792 INFO L225 Difference]: With dead ends: 1310726 [2019-10-03 02:33:28,792 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:33:28,793 INFO L640 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-10-03 02:33:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:33:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:33:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:33:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:33:28,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-10-03 02:33:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:28,794 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:33:28,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:33:28,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:33:28,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:33:28 BoogieIcfgContainer [2019-10-03 02:33:28,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:33:28,802 INFO L168 Benchmark]: Toolchain (without parser) took 150592.23 ms. Allocated memory was 134.7 MB in the beginning and 4.5 GB in the end (delta: 4.4 GB). Free memory was 89.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,803 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.49 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 89.6 MB in the beginning and 175.9 MB in the end (delta: -86.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,804 INFO L168 Benchmark]: Boogie Preprocessor took 56.77 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 174.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,805 INFO L168 Benchmark]: RCFGBuilder took 494.99 ms. Allocated memory is still 199.8 MB. Free memory was 174.1 MB in the beginning and 150.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,805 INFO L168 Benchmark]: TraceAbstraction took 149605.76 ms. Allocated memory was 199.8 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 150.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-10-03 02:33:28,812 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 427.49 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 89.6 MB in the beginning and 175.9 MB in the end (delta: -86.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.77 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 174.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.99 ms. Allocated memory is still 199.8 MB. Free memory was 174.1 MB in the beginning and 150.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149605.76 ms. Allocated memory was 199.8 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 150.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. SAFE Result, 149.5s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 97.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...