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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:12,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:12,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:12,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:12,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:12,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:12,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:12,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:12,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:12,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:12,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:12,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:12,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:12,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:12,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:12,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:12,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:12,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:12,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:12,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:12,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:12,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:12,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:12,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:12,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:12,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:12,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:12,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:12,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:12,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:12,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:12,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:12,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:12,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:12,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:12,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:12,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:12,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:12,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:12,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:12,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:12,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:24:12,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:12,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:12,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:12,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:12,297 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:12,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:12,297 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:12,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:12,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:12,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:12,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:12,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:12,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:12,298 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:12,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:12,299 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:12,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:12,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:12,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:12,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:12,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:12,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:12,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:12,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:12,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:12,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:12,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:12,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:12,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:12,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:12,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:12,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:12,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:12,602 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:12,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:12,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b1353c/e705085efc8643a98a4c658e947c8207/FLAG6fdaac76b [2019-10-13 21:24:13,134 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:13,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:13,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b1353c/e705085efc8643a98a4c658e947c8207/FLAG6fdaac76b [2019-10-13 21:24:13,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b1353c/e705085efc8643a98a4c658e947c8207 [2019-10-13 21:24:13,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:13,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:13,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:13,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:13,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:13,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195c7a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:13, skipping insertion in model container [2019-10-13 21:24:13,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:13,544 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:13,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:13,859 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:14,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:14,086 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:14,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14 WrapperNode [2019-10-13 21:24:14,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:14,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:14,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:14,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:14,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:14,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:14,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:14,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:14,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (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-13 21:24:14,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:14,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:14,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:15,023 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:15,023 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:15,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:15 BoogieIcfgContainer [2019-10-13 21:24:15,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:15,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:15,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:15,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:15,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:13" (1/3) ... [2019-10-13 21:24:15,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710db35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:15, skipping insertion in model container [2019-10-13 21:24:15,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (2/3) ... [2019-10-13 21:24:15,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710db35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:15, skipping insertion in model container [2019-10-13 21:24:15,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:15" (3/3) ... [2019-10-13 21:24:15,034 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:15,045 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:15,055 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:15,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:15,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:15,097 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:15,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:15,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:15,098 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:15,098 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:15,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:15,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-13 21:24:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:24:15,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:15,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:15,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-10-13 21:24:15,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:15,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752343574] [2019-10-13 21:24:15,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:15,622 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-13 21:24:15,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752343574] [2019-10-13 21:24:15,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:15,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:15,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804174944] [2019-10-13 21:24:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:15,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:15,649 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-10-13 21:24:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:16,092 INFO L93 Difference]: Finished difference Result 721 states and 1142 transitions. [2019-10-13 21:24:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:24:16,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-13 21:24:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:16,123 INFO L225 Difference]: With dead ends: 721 [2019-10-13 21:24:16,124 INFO L226 Difference]: Without dead ends: 630 [2019-10-13 21:24:16,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:24:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-13 21:24:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-10-13 21:24:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-13 21:24:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-10-13 21:24:16,243 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-10-13 21:24:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:16,244 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-10-13 21:24:16,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-10-13 21:24:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:16,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:16,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:16,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-10-13 21:24:16,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:16,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691078735] [2019-10-13 21:24:16,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:16,399 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-13 21:24:16,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691078735] [2019-10-13 21:24:16,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:16,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:16,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516863784] [2019-10-13 21:24:16,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:16,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:16,405 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-10-13 21:24:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:16,478 INFO L93 Difference]: Finished difference Result 1104 states and 1713 transitions. [2019-10-13 21:24:16,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:16,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-13 21:24:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:16,484 INFO L225 Difference]: With dead ends: 1104 [2019-10-13 21:24:16,484 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:24:16,487 INFO L600 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-13 21:24:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:24:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-10-13 21:24:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-13 21:24:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-10-13 21:24:16,541 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-10-13 21:24:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:16,541 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-10-13 21:24:16,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-10-13 21:24:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:16,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:16,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:16,545 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-10-13 21:24:16,546 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:16,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166880993] [2019-10-13 21:24:16,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:16,636 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-13 21:24:16,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166880993] [2019-10-13 21:24:16,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:16,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:16,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127247908] [2019-10-13 21:24:16,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:16,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:16,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:16,642 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-10-13 21:24:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:16,757 INFO L93 Difference]: Finished difference Result 2006 states and 3079 transitions. [2019-10-13 21:24:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:16,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-13 21:24:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:16,767 INFO L225 Difference]: With dead ends: 2006 [2019-10-13 21:24:16,767 INFO L226 Difference]: Without dead ends: 1335 [2019-10-13 21:24:16,770 INFO L600 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-13 21:24:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-13 21:24:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-10-13 21:24:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-13 21:24:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-10-13 21:24:16,859 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-10-13 21:24:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:16,860 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-10-13 21:24:16,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-10-13 21:24:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:16,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:16,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:16,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-10-13 21:24:16,864 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:16,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509804229] [2019-10-13 21:24:16,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:16,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:17,086 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-13 21:24:17,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509804229] [2019-10-13 21:24:17,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:17,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:17,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693714543] [2019-10-13 21:24:17,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:17,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:17,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:17,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:17,089 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 10 states. [2019-10-13 21:24:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:18,960 INFO L93 Difference]: Finished difference Result 7842 states and 11792 transitions. [2019-10-13 21:24:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:18,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-13 21:24:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:18,997 INFO L225 Difference]: With dead ends: 7842 [2019-10-13 21:24:18,998 INFO L226 Difference]: Without dead ends: 7341 [2019-10-13 21:24:19,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:24:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-13 21:24:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 1358. [2019-10-13 21:24:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-13 21:24:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2019-10-13 21:24:19,221 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 56 [2019-10-13 21:24:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:19,222 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2019-10-13 21:24:19,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2019-10-13 21:24:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:19,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:19,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:19,225 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-10-13 21:24:19,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:19,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181598040] [2019-10-13 21:24:19,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:19,329 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-13 21:24:19,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181598040] [2019-10-13 21:24:19,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:19,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:19,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388770233] [2019-10-13 21:24:19,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:19,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:19,332 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand 7 states. [2019-10-13 21:24:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:20,509 INFO L93 Difference]: Finished difference Result 5747 states and 8758 transitions. [2019-10-13 21:24:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:20,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-13 21:24:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:20,536 INFO L225 Difference]: With dead ends: 5747 [2019-10-13 21:24:20,536 INFO L226 Difference]: Without dead ends: 5246 [2019-10-13 21:24:20,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-13 21:24:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 1339. [2019-10-13 21:24:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-13 21:24:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2009 transitions. [2019-10-13 21:24:20,699 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2009 transitions. Word has length 57 [2019-10-13 21:24:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:20,700 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2009 transitions. [2019-10-13 21:24:20,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:24:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2009 transitions. [2019-10-13 21:24:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:20,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:20,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:20,702 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-10-13 21:24:20,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:20,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517406730] [2019-10-13 21:24:20,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:20,826 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-13 21:24:20,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517406730] [2019-10-13 21:24:20,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:20,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:20,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136349012] [2019-10-13 21:24:20,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:20,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:20,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:20,829 INFO L87 Difference]: Start difference. First operand 1339 states and 2009 transitions. Second operand 9 states. [2019-10-13 21:24:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:23,073 INFO L93 Difference]: Finished difference Result 8481 states and 12775 transitions. [2019-10-13 21:24:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:23,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 21:24:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:23,111 INFO L225 Difference]: With dead ends: 8481 [2019-10-13 21:24:23,112 INFO L226 Difference]: Without dead ends: 7351 [2019-10-13 21:24:23,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:24:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-10-13 21:24:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 1378. [2019-10-13 21:24:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-10-13 21:24:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2060 transitions. [2019-10-13 21:24:23,314 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2060 transitions. Word has length 57 [2019-10-13 21:24:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:23,315 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 2060 transitions. [2019-10-13 21:24:23,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2060 transitions. [2019-10-13 21:24:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:23,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:23,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:23,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-10-13 21:24:23,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:23,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554570541] [2019-10-13 21:24:23,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:23,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:23,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:23,438 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-13 21:24:23,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554570541] [2019-10-13 21:24:23,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:23,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:23,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236105109] [2019-10-13 21:24:23,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:23,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:23,441 INFO L87 Difference]: Start difference. First operand 1378 states and 2060 transitions. Second operand 7 states. [2019-10-13 21:24:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:24,250 INFO L93 Difference]: Finished difference Result 5650 states and 8490 transitions. [2019-10-13 21:24:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:24,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-13 21:24:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:24,271 INFO L225 Difference]: With dead ends: 5650 [2019-10-13 21:24:24,271 INFO L226 Difference]: Without dead ends: 4520 [2019-10-13 21:24:24,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-13 21:24:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1359. [2019-10-13 21:24:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-10-13 21:24:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2033 transitions. [2019-10-13 21:24:24,465 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2033 transitions. Word has length 58 [2019-10-13 21:24:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:24,466 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2033 transitions. [2019-10-13 21:24:24,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:24:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2033 transitions. [2019-10-13 21:24:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:24,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:24,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:24,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:24,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1839206206, now seen corresponding path program 1 times [2019-10-13 21:24:24,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:24,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041744256] [2019-10-13 21:24:24,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:24,598 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-13 21:24:24,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041744256] [2019-10-13 21:24:24,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:24,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:24,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072898442] [2019-10-13 21:24:24,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:24,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:24,601 INFO L87 Difference]: Start difference. First operand 1359 states and 2033 transitions. Second operand 9 states. [2019-10-13 21:24:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:26,028 INFO L93 Difference]: Finished difference Result 7327 states and 11032 transitions. [2019-10-13 21:24:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:26,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 21:24:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:26,045 INFO L225 Difference]: With dead ends: 7327 [2019-10-13 21:24:26,045 INFO L226 Difference]: Without dead ends: 6095 [2019-10-13 21:24:26,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-10-13 21:24:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3782. [2019-10-13 21:24:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-10-13 21:24:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5672 transitions. [2019-10-13 21:24:26,451 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5672 transitions. Word has length 58 [2019-10-13 21:24:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:26,451 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5672 transitions. [2019-10-13 21:24:26,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5672 transitions. [2019-10-13 21:24:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:26,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:26,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:26,456 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1369199573, now seen corresponding path program 1 times [2019-10-13 21:24:26,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:26,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68233842] [2019-10-13 21:24:26,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:26,581 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-13 21:24:26,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68233842] [2019-10-13 21:24:26,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:26,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:26,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139737753] [2019-10-13 21:24:26,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:26,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:26,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:26,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:26,584 INFO L87 Difference]: Start difference. First operand 3782 states and 5672 transitions. Second operand 9 states. [2019-10-13 21:24:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:29,038 INFO L93 Difference]: Finished difference Result 19307 states and 28995 transitions. [2019-10-13 21:24:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:29,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 21:24:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:29,077 INFO L225 Difference]: With dead ends: 19307 [2019-10-13 21:24:29,077 INFO L226 Difference]: Without dead ends: 15977 [2019-10-13 21:24:29,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-13 21:24:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 11695. [2019-10-13 21:24:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-10-13 21:24:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 17676 transitions. [2019-10-13 21:24:30,382 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 17676 transitions. Word has length 58 [2019-10-13 21:24:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:30,382 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 17676 transitions. [2019-10-13 21:24:30,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 17676 transitions. [2019-10-13 21:24:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:30,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:30,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:30,389 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-10-13 21:24:30,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:30,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446888379] [2019-10-13 21:24:30,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:30,464 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-13 21:24:30,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446888379] [2019-10-13 21:24:30,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:30,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:30,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110611867] [2019-10-13 21:24:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:30,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:30,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:30,467 INFO L87 Difference]: Start difference. First operand 11695 states and 17676 transitions. Second operand 6 states. [2019-10-13 21:24:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:32,322 INFO L93 Difference]: Finished difference Result 26750 states and 40687 transitions. [2019-10-13 21:24:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:32,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-13 21:24:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:32,364 INFO L225 Difference]: With dead ends: 26750 [2019-10-13 21:24:32,365 INFO L226 Difference]: Without dead ends: 16014 [2019-10-13 21:24:32,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-10-13 21:24:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 9824. [2019-10-13 21:24:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2019-10-13 21:24:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 14759 transitions. [2019-10-13 21:24:33,633 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 14759 transitions. Word has length 59 [2019-10-13 21:24:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:33,634 INFO L462 AbstractCegarLoop]: Abstraction has 9824 states and 14759 transitions. [2019-10-13 21:24:33,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 14759 transitions. [2019-10-13 21:24:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:33,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:33,637 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:33,638 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash -90485979, now seen corresponding path program 1 times [2019-10-13 21:24:33,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:33,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956841733] [2019-10-13 21:24:33,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:33,706 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-13 21:24:33,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956841733] [2019-10-13 21:24:33,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:33,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:33,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362702736] [2019-10-13 21:24:33,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:33,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:33,708 INFO L87 Difference]: Start difference. First operand 9824 states and 14759 transitions. Second operand 6 states. [2019-10-13 21:24:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,195 INFO L93 Difference]: Finished difference Result 20559 states and 30871 transitions. [2019-10-13 21:24:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:35,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-13 21:24:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,216 INFO L225 Difference]: With dead ends: 20559 [2019-10-13 21:24:35,216 INFO L226 Difference]: Without dead ends: 11316 [2019-10-13 21:24:35,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2019-10-13 21:24:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 7633. [2019-10-13 21:24:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-13 21:24:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11363 transitions. [2019-10-13 21:24:36,344 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11363 transitions. Word has length 59 [2019-10-13 21:24:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11363 transitions. [2019-10-13 21:24:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11363 transitions. [2019-10-13 21:24:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:36,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:36,347 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash -226647092, now seen corresponding path program 1 times [2019-10-13 21:24:36,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154488384] [2019-10-13 21:24:36,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,402 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-13 21:24:36,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154488384] [2019-10-13 21:24:36,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:36,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272915687] [2019-10-13 21:24:36,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:36,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:36,404 INFO L87 Difference]: Start difference. First operand 7633 states and 11363 transitions. Second operand 5 states. [2019-10-13 21:24:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:37,922 INFO L93 Difference]: Finished difference Result 18447 states and 27375 transitions. [2019-10-13 21:24:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:37,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 21:24:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:37,941 INFO L225 Difference]: With dead ends: 18447 [2019-10-13 21:24:37,942 INFO L226 Difference]: Without dead ends: 10894 [2019-10-13 21:24:37,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-10-13 21:24:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 7633. [2019-10-13 21:24:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-13 21:24:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-10-13 21:24:39,461 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-10-13 21:24:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,462 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-10-13 21:24:39,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-10-13 21:24:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:39,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:39,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-10-13 21:24:39,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286286187] [2019-10-13 21:24:39,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:39,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286286187] [2019-10-13 21:24:39,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:39,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864849444] [2019-10-13 21:24:39,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:39,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:39,560 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-10-13 21:24:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:41,409 INFO L93 Difference]: Finished difference Result 20122 states and 29836 transitions. [2019-10-13 21:24:41,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:41,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-13 21:24:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:41,426 INFO L225 Difference]: With dead ends: 20122 [2019-10-13 21:24:41,426 INFO L226 Difference]: Without dead ends: 16178 [2019-10-13 21:24:41,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-10-13 21:24:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-10-13 21:24:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-10-13 21:24:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-10-13 21:24:42,704 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-10-13 21:24:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:42,704 INFO L462 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-10-13 21:24:42,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-10-13 21:24:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:42,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:42,707 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:42,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-10-13 21:24:42,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:42,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976038481] [2019-10-13 21:24:42,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:42,786 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-13 21:24:42,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976038481] [2019-10-13 21:24:42,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:42,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:42,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873921705] [2019-10-13 21:24:42,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:42,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:42,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:42,788 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-10-13 21:24:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:45,111 INFO L93 Difference]: Finished difference Result 21379 states and 31737 transitions. [2019-10-13 21:24:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:45,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-13 21:24:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:45,137 INFO L225 Difference]: With dead ends: 21379 [2019-10-13 21:24:45,137 INFO L226 Difference]: Without dead ends: 17435 [2019-10-13 21:24:45,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-10-13 21:24:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-10-13 21:24:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-10-13 21:24:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-10-13 21:24:47,433 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-10-13 21:24:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:47,433 INFO L462 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-10-13 21:24:47,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-10-13 21:24:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:24:47,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:47,437 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-10-13 21:24:47,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70100888] [2019-10-13 21:24:47,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:47,510 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-13 21:24:47,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70100888] [2019-10-13 21:24:47,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:47,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:47,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185947008] [2019-10-13 21:24:47,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:47,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:47,512 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states.