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/systemc/toy.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:40,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:40,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:40,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:40,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:40,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:40,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:40,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:40,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:40,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:40,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:40,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:40,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:40,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:40,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:40,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:40,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:40,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:40,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:40,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:40,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:40,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:40,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:40,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:40,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:40,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:40,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:40,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:40,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:40,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:40,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:40,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:40,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:40,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:40,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:40,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:40,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:40,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:40,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:40,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:40,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:40,624 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-15 01:28:40,639 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:40,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:40,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:40,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:40,641 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:40,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:40,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:40,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:40,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:40,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:40,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:40,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:40,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:40,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:40,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:40,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:40,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:40,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:40,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:40,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:40,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:40,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:40,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:40,646 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-15 01:28:40,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:40,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:40,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:40,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:40,947 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:40,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy.cil.c [2019-10-15 01:28:41,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d5a0c38/d53d8744a0504996ac51bd9c1db93a41/FLAGe7ba59580 [2019-10-15 01:28:41,498 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:41,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c [2019-10-15 01:28:41,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d5a0c38/d53d8744a0504996ac51bd9c1db93a41/FLAGe7ba59580 [2019-10-15 01:28:41,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d5a0c38/d53d8744a0504996ac51bd9c1db93a41 [2019-10-15 01:28:41,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:41,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:41,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:41,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:41,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:41,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:41" (1/1) ... [2019-10-15 01:28:41,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd445f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:41, skipping insertion in model container [2019-10-15 01:28:41,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:41" (1/1) ... [2019-10-15 01:28:41,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:41,941 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:42,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:42,286 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:42,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:42,552 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:42,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42 WrapperNode [2019-10-15 01:28:42,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:42,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:42,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:42,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:42,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (1/1) ... [2019-10-15 01:28:42,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:42,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:42,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:42,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:42,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (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-15 01:28:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-15 01:28:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-15 01:28:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-15 01:28:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-15 01:28:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-15 01:28:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:42,682 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:42,682 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-15 01:28:42,682 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:43,425 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:43,426 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:28:43,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:43 BoogieIcfgContainer [2019-10-15 01:28:43,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:43,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:43,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:43,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:43,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:41" (1/3) ... [2019-10-15 01:28:43,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3a411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:43, skipping insertion in model container [2019-10-15 01:28:43,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:42" (2/3) ... [2019-10-15 01:28:43,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3a411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:43, skipping insertion in model container [2019-10-15 01:28:43,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:43" (3/3) ... [2019-10-15 01:28:43,436 INFO L109 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2019-10-15 01:28:43,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:43,458 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:43,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:43,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:43,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:43,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:43,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:43,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:43,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:43,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:43,505 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-10-15 01:28:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:43,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,551 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] [2019-10-15 01:28:43,553 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2004131150, now seen corresponding path program 1 times [2019-10-15 01:28:43,566 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101274875] [2019-10-15 01:28:43,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,870 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-15 01:28:43,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101274875] [2019-10-15 01:28:43,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:43,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183781294] [2019-10-15 01:28:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:43,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:43,903 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2019-10-15 01:28:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,972 INFO L93 Difference]: Finished difference Result 300 states and 513 transitions. [2019-10-15 01:28:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:43,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,988 INFO L225 Difference]: With dead ends: 300 [2019-10-15 01:28:43,988 INFO L226 Difference]: Without dead ends: 150 [2019-10-15 01:28:43,993 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-15 01:28:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-15 01:28:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-10-15 01:28:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 01:28:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 243 transitions. [2019-10-15 01:28:44,049 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 243 transitions. Word has length 47 [2019-10-15 01:28:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,050 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 243 transitions. [2019-10-15 01:28:44,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 243 transitions. [2019-10-15 01:28:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:44,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,054 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] [2019-10-15 01:28:44,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 46852848, now seen corresponding path program 1 times [2019-10-15 01:28:44,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597308333] [2019-10-15 01:28:44,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,167 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-15 01:28:44,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597308333] [2019-10-15 01:28:44,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:44,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174544799] [2019-10-15 01:28:44,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:44,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:44,172 INFO L87 Difference]: Start difference. First operand 150 states and 243 transitions. Second operand 4 states. [2019-10-15 01:28:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,501 INFO L93 Difference]: Finished difference Result 405 states and 666 transitions. [2019-10-15 01:28:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:44,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,506 INFO L225 Difference]: With dead ends: 405 [2019-10-15 01:28:44,506 INFO L226 Difference]: Without dead ends: 273 [2019-10-15 01:28:44,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-15 01:28:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2019-10-15 01:28:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-15 01:28:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 438 transitions. [2019-10-15 01:28:44,553 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 438 transitions. Word has length 47 [2019-10-15 01:28:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,553 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 438 transitions. [2019-10-15 01:28:44,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 438 transitions. [2019-10-15 01:28:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:44,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,559 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] [2019-10-15 01:28:44,559 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,561 INFO L82 PathProgramCache]: Analyzing trace with hash -227906766, now seen corresponding path program 1 times [2019-10-15 01:28:44,562 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452411956] [2019-10-15 01:28:44,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,716 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-15 01:28:44,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452411956] [2019-10-15 01:28:44,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:44,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545250791] [2019-10-15 01:28:44,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:44,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:44,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:44,720 INFO L87 Difference]: Start difference. First operand 265 states and 438 transitions. Second operand 4 states. [2019-10-15 01:28:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,925 INFO L93 Difference]: Finished difference Result 756 states and 1262 transitions. [2019-10-15 01:28:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:44,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,934 INFO L225 Difference]: With dead ends: 756 [2019-10-15 01:28:44,935 INFO L226 Difference]: Without dead ends: 511 [2019-10-15 01:28:44,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-15 01:28:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-10-15 01:28:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-10-15 01:28:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 835 transitions. [2019-10-15 01:28:45,004 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 835 transitions. Word has length 47 [2019-10-15 01:28:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,005 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 835 transitions. [2019-10-15 01:28:45,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 835 transitions. [2019-10-15 01:28:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,013 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] [2019-10-15 01:28:45,013 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2901456, now seen corresponding path program 1 times [2019-10-15 01:28:45,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848055619] [2019-10-15 01:28:45,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,121 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-15 01:28:45,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848055619] [2019-10-15 01:28:45,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:45,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495735375] [2019-10-15 01:28:45,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:45,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:45,124 INFO L87 Difference]: Start difference. First operand 503 states and 835 transitions. Second operand 4 states. [2019-10-15 01:28:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,373 INFO L93 Difference]: Finished difference Result 1360 states and 2261 transitions. [2019-10-15 01:28:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:45,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,382 INFO L225 Difference]: With dead ends: 1360 [2019-10-15 01:28:45,382 INFO L226 Difference]: Without dead ends: 887 [2019-10-15 01:28:45,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-10-15 01:28:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 871. [2019-10-15 01:28:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-10-15 01:28:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1439 transitions. [2019-10-15 01:28:45,444 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1439 transitions. Word has length 47 [2019-10-15 01:28:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,445 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1439 transitions. [2019-10-15 01:28:45,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1439 transitions. [2019-10-15 01:28:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,448 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] [2019-10-15 01:28:45,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 698698418, now seen corresponding path program 1 times [2019-10-15 01:28:45,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127906624] [2019-10-15 01:28:45,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,504 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-15 01:28:45,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127906624] [2019-10-15 01:28:45,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:45,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407905786] [2019-10-15 01:28:45,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:45,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,506 INFO L87 Difference]: Start difference. First operand 871 states and 1439 transitions. Second operand 3 states. [2019-10-15 01:28:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,604 INFO L93 Difference]: Finished difference Result 2243 states and 3683 transitions. [2019-10-15 01:28:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:45,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,616 INFO L225 Difference]: With dead ends: 2243 [2019-10-15 01:28:45,617 INFO L226 Difference]: Without dead ends: 1410 [2019-10-15 01:28:45,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 01:28:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-10-15 01:28:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1399. [2019-10-15 01:28:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-10-15 01:28:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2278 transitions. [2019-10-15 01:28:45,717 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2278 transitions. Word has length 47 [2019-10-15 01:28:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,717 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 2278 transitions. [2019-10-15 01:28:45,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2278 transitions. [2019-10-15 01:28:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,724 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] [2019-10-15 01:28:45,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2084901812, now seen corresponding path program 1 times [2019-10-15 01:28:45,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457635730] [2019-10-15 01:28:45,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,828 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-15 01:28:45,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457635730] [2019-10-15 01:28:45,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:45,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858168736] [2019-10-15 01:28:45,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:45,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,831 INFO L87 Difference]: Start difference. First operand 1399 states and 2278 transitions. Second operand 3 states. [2019-10-15 01:28:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,015 INFO L93 Difference]: Finished difference Result 3728 states and 6242 transitions. [2019-10-15 01:28:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:46,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,031 INFO L225 Difference]: With dead ends: 3728 [2019-10-15 01:28:46,031 INFO L226 Difference]: Without dead ends: 2371 [2019-10-15 01:28:46,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-10-15 01:28:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2353. [2019-10-15 01:28:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-10-15 01:28:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3878 transitions. [2019-10-15 01:28:46,184 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3878 transitions. Word has length 47 [2019-10-15 01:28:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,184 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 3878 transitions. [2019-10-15 01:28:46,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3878 transitions. [2019-10-15 01:28:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:46,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,188 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] [2019-10-15 01:28:46,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash -785421443, now seen corresponding path program 1 times [2019-10-15 01:28:46,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799680779] [2019-10-15 01:28:46,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,233 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-15 01:28:46,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799680779] [2019-10-15 01:28:46,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:46,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761059334] [2019-10-15 01:28:46,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:46,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:46,236 INFO L87 Difference]: Start difference. First operand 2353 states and 3878 transitions. Second operand 3 states. [2019-10-15 01:28:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,385 INFO L93 Difference]: Finished difference Result 4790 states and 7936 transitions. [2019-10-15 01:28:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:46,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,404 INFO L225 Difference]: With dead ends: 4790 [2019-10-15 01:28:46,405 INFO L226 Difference]: Without dead ends: 2515 [2019-10-15 01:28:46,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 01:28:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2019-10-15 01:28:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2019-10-15 01:28:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2019-10-15 01:28:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 4142 transitions. [2019-10-15 01:28:46,609 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 4142 transitions. Word has length 47 [2019-10-15 01:28:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,610 INFO L462 AbstractCegarLoop]: Abstraction has 2515 states and 4142 transitions. [2019-10-15 01:28:46,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 4142 transitions. [2019-10-15 01:28:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:46,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,613 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] [2019-10-15 01:28:46,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 15163777, now seen corresponding path program 1 times [2019-10-15 01:28:46,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725986261] [2019-10-15 01:28:46,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,662 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-15 01:28:46,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725986261] [2019-10-15 01:28:46,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292330124] [2019-10-15 01:28:46,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,664 INFO L87 Difference]: Start difference. First operand 2515 states and 4142 transitions. Second operand 4 states. [2019-10-15 01:28:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,940 INFO L93 Difference]: Finished difference Result 5315 states and 8758 transitions. [2019-10-15 01:28:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:46,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,962 INFO L225 Difference]: With dead ends: 5315 [2019-10-15 01:28:46,962 INFO L226 Difference]: Without dead ends: 2858 [2019-10-15 01:28:46,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-15 01:28:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2827. [2019-10-15 01:28:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-10-15 01:28:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4600 transitions. [2019-10-15 01:28:47,234 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4600 transitions. Word has length 47 [2019-10-15 01:28:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,236 INFO L462 AbstractCegarLoop]: Abstraction has 2827 states and 4600 transitions. [2019-10-15 01:28:47,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4600 transitions. [2019-10-15 01:28:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:47,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,239 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] [2019-10-15 01:28:47,240 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash 234018495, now seen corresponding path program 1 times [2019-10-15 01:28:47,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267144545] [2019-10-15 01:28:47,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,292 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-15 01:28:47,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267144545] [2019-10-15 01:28:47,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:47,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710129165] [2019-10-15 01:28:47,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:47,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:47,296 INFO L87 Difference]: Start difference. First operand 2827 states and 4600 transitions. Second operand 4 states. [2019-10-15 01:28:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,663 INFO L93 Difference]: Finished difference Result 6484 states and 10567 transitions. [2019-10-15 01:28:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:47,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,694 INFO L225 Difference]: With dead ends: 6484 [2019-10-15 01:28:47,694 INFO L226 Difference]: Without dead ends: 3763 [2019-10-15 01:28:47,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2019-10-15 01:28:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3724. [2019-10-15 01:28:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-10-15 01:28:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 6025 transitions. [2019-10-15 01:28:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 6025 transitions. Word has length 47 [2019-10-15 01:28:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,010 INFO L462 AbstractCegarLoop]: Abstraction has 3724 states and 6025 transitions. [2019-10-15 01:28:48,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 6025 transitions. [2019-10-15 01:28:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:48,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,017 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] [2019-10-15 01:28:48,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash -583629955, now seen corresponding path program 1 times [2019-10-15 01:28:48,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088904375] [2019-10-15 01:28:48,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,079 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-15 01:28:48,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088904375] [2019-10-15 01:28:48,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:48,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294280741] [2019-10-15 01:28:48,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:48,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:48,081 INFO L87 Difference]: Start difference. First operand 3724 states and 6025 transitions. Second operand 3 states. [2019-10-15 01:28:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,276 INFO L93 Difference]: Finished difference Result 7887 states and 12968 transitions. [2019-10-15 01:28:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,303 INFO L225 Difference]: With dead ends: 7887 [2019-10-15 01:28:48,303 INFO L226 Difference]: Without dead ends: 4317 [2019-10-15 01:28:48,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-10-15 01:28:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4317. [2019-10-15 01:28:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-10-15 01:28:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6923 transitions. [2019-10-15 01:28:48,554 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6923 transitions. Word has length 47 [2019-10-15 01:28:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,554 INFO L462 AbstractCegarLoop]: Abstraction has 4317 states and 6923 transitions. [2019-10-15 01:28:48,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6923 transitions. [2019-10-15 01:28:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:48,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,558 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] [2019-10-15 01:28:48,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1717192635, now seen corresponding path program 1 times [2019-10-15 01:28:48,559 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139557452] [2019-10-15 01:28:48,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,733 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-15 01:28:48,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139557452] [2019-10-15 01:28:48,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:48,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038224056] [2019-10-15 01:28:48,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:48,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:48,735 INFO L87 Difference]: Start difference. First operand 4317 states and 6923 transitions. Second operand 3 states. [2019-10-15 01:28:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,976 INFO L93 Difference]: Finished difference Result 9236 states and 15133 transitions. [2019-10-15 01:28:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,020 INFO L225 Difference]: With dead ends: 9236 [2019-10-15 01:28:49,020 INFO L226 Difference]: Without dead ends: 4971 [2019-10-15 01:28:49,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-15 01:28:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4971 states. [2019-10-15 01:28:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4971 to 4895. [2019-10-15 01:28:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2019-10-15 01:28:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 7778 transitions. [2019-10-15 01:28:49,284 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 7778 transitions. Word has length 47 [2019-10-15 01:28:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,284 INFO L462 AbstractCegarLoop]: Abstraction has 4895 states and 7778 transitions. [2019-10-15 01:28:49,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 7778 transitions. [2019-10-15 01:28:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 01:28:49,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,298 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:49,298 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -683599016, now seen corresponding path program 1 times [2019-10-15 01:28:49,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393158112] [2019-10-15 01:28:49,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:28:49,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393158112] [2019-10-15 01:28:49,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875877169] [2019-10-15 01:28:49,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:49,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:49,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:28:49,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:49,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-15 01:28:49,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636312822] [2019-10-15 01:28:49,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:49,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:49,815 INFO L87 Difference]: Start difference. First operand 4895 states and 7778 transitions. Second operand 3 states. [2019-10-15 01:28:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,222 INFO L93 Difference]: Finished difference Result 11584 states and 18753 transitions. [2019-10-15 01:28:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:50,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-15 01:28:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,257 INFO L225 Difference]: With dead ends: 11584 [2019-10-15 01:28:50,258 INFO L226 Difference]: Without dead ends: 4015 [2019-10-15 01:28:50,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2019-10-15 01:28:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4015. [2019-10-15 01:28:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4015 states. [2019-10-15 01:28:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 6178 transitions. [2019-10-15 01:28:50,658 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 6178 transitions. Word has length 81 [2019-10-15 01:28:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,658 INFO L462 AbstractCegarLoop]: Abstraction has 4015 states and 6178 transitions. [2019-10-15 01:28:50,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 6178 transitions. [2019-10-15 01:28:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:50,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,683 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:50,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:50,893 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1582511080, now seen corresponding path program 1 times [2019-10-15 01:28:50,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487344931] [2019-10-15 01:28:50,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:51,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487344931] [2019-10-15 01:28:51,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:51,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:51,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332625055] [2019-10-15 01:28:51,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:51,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:51,014 INFO L87 Difference]: Start difference. First operand 4015 states and 6178 transitions. Second operand 5 states. [2019-10-15 01:28:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,553 INFO L93 Difference]: Finished difference Result 6473 states and 10061 transitions. [2019-10-15 01:28:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:28:51,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-15 01:28:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,577 INFO L225 Difference]: With dead ends: 6473 [2019-10-15 01:28:51,577 INFO L226 Difference]: Without dead ends: 4331 [2019-10-15 01:28:51,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2019-10-15 01:28:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4097. [2019-10-15 01:28:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-10-15 01:28:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6372 transitions. [2019-10-15 01:28:51,995 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6372 transitions. Word has length 122 [2019-10-15 01:28:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,997 INFO L462 AbstractCegarLoop]: Abstraction has 4097 states and 6372 transitions. [2019-10-15 01:28:51,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6372 transitions. [2019-10-15 01:28:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:52,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,021 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:52,021 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash -247883034, now seen corresponding path program 1 times [2019-10-15 01:28:52,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26567806] [2019-10-15 01:28:52,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:52,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26567806] [2019-10-15 01:28:52,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:52,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804279813] [2019-10-15 01:28:52,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:52,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:52,102 INFO L87 Difference]: Start difference. First operand 4097 states and 6372 transitions. Second operand 3 states. [2019-10-15 01:28:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,336 INFO L93 Difference]: Finished difference Result 8019 states and 12798 transitions. [2019-10-15 01:28:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:52,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 01:28:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,356 INFO L225 Difference]: With dead ends: 8019 [2019-10-15 01:28:52,357 INFO L226 Difference]: Without dead ends: 3984 [2019-10-15 01:28:52,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 01:28:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2019-10-15 01:28:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3951. [2019-10-15 01:28:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-10-15 01:28:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 6041 transitions. [2019-10-15 01:28:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 6041 transitions. Word has length 122 [2019-10-15 01:28:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,678 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 6041 transitions. [2019-10-15 01:28:52,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 6041 transitions. [2019-10-15 01:28:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:28:52,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,705 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:52,705 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1614311007, now seen corresponding path program 1 times [2019-10-15 01:28:52,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433868007] [2019-10-15 01:28:52,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:52,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433868007] [2019-10-15 01:28:52,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:52,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683536647] [2019-10-15 01:28:52,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:52,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:52,831 INFO L87 Difference]: Start difference. First operand 3951 states and 6041 transitions. Second operand 4 states. [2019-10-15 01:28:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,754 INFO L93 Difference]: Finished difference Result 11421 states and 17688 transitions. [2019-10-15 01:28:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:53,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-15 01:28:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,796 INFO L225 Difference]: With dead ends: 11421 [2019-10-15 01:28:53,796 INFO L226 Difference]: Without dead ends: 7479 [2019-10-15 01:28:53,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2019-10-15 01:28:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 6799. [2019-10-15 01:28:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6799 states. [2019-10-15 01:28:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10535 transitions. [2019-10-15 01:28:54,217 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10535 transitions. Word has length 124 [2019-10-15 01:28:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,217 INFO L462 AbstractCegarLoop]: Abstraction has 6799 states and 10535 transitions. [2019-10-15 01:28:54,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10535 transitions. [2019-10-15 01:28:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:54,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,245 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:54,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2087738908, now seen corresponding path program 1 times [2019-10-15 01:28:54,246 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024213108] [2019-10-15 01:28:54,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:28:54,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024213108] [2019-10-15 01:28:54,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:54,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334273012] [2019-10-15 01:28:54,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:54,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:54,305 INFO L87 Difference]: Start difference. First operand 6799 states and 10535 transitions. Second operand 4 states. [2019-10-15 01:28:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,851 INFO L93 Difference]: Finished difference Result 12642 states and 19733 transitions. [2019-10-15 01:28:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:54,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:28:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,884 INFO L225 Difference]: With dead ends: 12642 [2019-10-15 01:28:54,884 INFO L226 Difference]: Without dead ends: 5866 [2019-10-15 01:28:54,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2019-10-15 01:28:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5858. [2019-10-15 01:28:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5858 states. [2019-10-15 01:28:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 9001 transitions. [2019-10-15 01:28:55,237 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 9001 transitions. Word has length 122 [2019-10-15 01:28:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,237 INFO L462 AbstractCegarLoop]: Abstraction has 5858 states and 9001 transitions. [2019-10-15 01:28:55,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 9001 transitions. [2019-10-15 01:28:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:28:55,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,261 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:55,261 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1343182230, now seen corresponding path program 1 times [2019-10-15 01:28:55,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254970246] [2019-10-15 01:28:55,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:55,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254970246] [2019-10-15 01:28:55,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218723283] [2019-10-15 01:28:55,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:55,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:28:55,657 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:55,728 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:55,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:55,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505805898] [2019-10-15 01:28:55,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:55,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:55,731 INFO L87 Difference]: Start difference. First operand 5858 states and 9001 transitions. Second operand 3 states. [2019-10-15 01:28:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,229 INFO L93 Difference]: Finished difference Result 13149 states and 21182 transitions. [2019-10-15 01:28:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:56,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-15 01:28:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,267 INFO L225 Difference]: With dead ends: 13149 [2019-10-15 01:28:56,267 INFO L226 Difference]: Without dead ends: 7324 [2019-10-15 01:28:56,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-10-15 01:28:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 7185. [2019-10-15 01:28:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2019-10-15 01:28:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 11025 transitions. [2019-10-15 01:28:56,817 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 11025 transitions. Word has length 133 [2019-10-15 01:28:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,818 INFO L462 AbstractCegarLoop]: Abstraction has 7185 states and 11025 transitions. [2019-10-15 01:28:56,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 11025 transitions. [2019-10-15 01:28:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:28:56,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,843 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:57,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,048 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -973049870, now seen corresponding path program 1 times [2019-10-15 01:28:57,050 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171338988] [2019-10-15 01:28:57,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:57,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171338988] [2019-10-15 01:28:57,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172871440] [2019-10-15 01:28:57,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:28:57,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:28:57,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:28:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:28:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:57,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:57,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-15 01:28:57,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292782629] [2019-10-15 01:28:57,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:57,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:57,601 INFO L87 Difference]: Start difference. First operand 7185 states and 11025 transitions. Second operand 5 states. [2019-10-15 01:28:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,339 INFO L93 Difference]: Finished difference Result 13884 states and 21723 transitions. [2019-10-15 01:28:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:58,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-15 01:28:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,380 INFO L225 Difference]: With dead ends: 13884 [2019-10-15 01:28:58,380 INFO L226 Difference]: Without dead ends: 8467 [2019-10-15 01:28:58,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8467 states. [2019-10-15 01:28:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8467 to 7797. [2019-10-15 01:28:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7797 states. [2019-10-15 01:28:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7797 states to 7797 states and 11988 transitions. [2019-10-15 01:28:58,880 INFO L78 Accepts]: Start accepts. Automaton has 7797 states and 11988 transitions. Word has length 134 [2019-10-15 01:28:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,881 INFO L462 AbstractCegarLoop]: Abstraction has 7797 states and 11988 transitions. [2019-10-15 01:28:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7797 states and 11988 transitions. [2019-10-15 01:28:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:28:58,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,907 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:59,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,113 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1935918065, now seen corresponding path program 1 times [2019-10-15 01:28:59,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753566677] [2019-10-15 01:28:59,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-15 01:28:59,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753566677] [2019-10-15 01:28:59,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:59,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723692597] [2019-10-15 01:28:59,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:59,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:59,241 INFO L87 Difference]: Start difference. First operand 7797 states and 11988 transitions. Second operand 3 states. [2019-10-15 01:28:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,542 INFO L93 Difference]: Finished difference Result 13071 states and 20199 transitions. [2019-10-15 01:28:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:59,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:28:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,568 INFO L225 Difference]: With dead ends: 13071 [2019-10-15 01:28:59,568 INFO L226 Difference]: Without dead ends: 5306 [2019-10-15 01:28:59,589 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-15 01:28:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2019-10-15 01:28:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 5306. [2019-10-15 01:28:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5306 states. [2019-10-15 01:28:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 7863 transitions. [2019-10-15 01:28:59,854 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 7863 transitions. Word has length 148 [2019-10-15 01:28:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,855 INFO L462 AbstractCegarLoop]: Abstraction has 5306 states and 7863 transitions. [2019-10-15 01:28:59,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 7863 transitions. [2019-10-15 01:28:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:28:59,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,868 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:59,868 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 327748300, now seen corresponding path program 1 times [2019-10-15 01:28:59,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197923947] [2019-10-15 01:28:59,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:28:59,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197923947] [2019-10-15 01:28:59,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:59,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367889532] [2019-10-15 01:28:59,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:59,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:59,929 INFO L87 Difference]: Start difference. First operand 5306 states and 7863 transitions. Second operand 3 states. [2019-10-15 01:29:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,219 INFO L93 Difference]: Finished difference Result 11262 states and 16818 transitions. [2019-10-15 01:29:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:00,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:29:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,297 INFO L225 Difference]: With dead ends: 11262 [2019-10-15 01:29:00,297 INFO L226 Difference]: Without dead ends: 5992 [2019-10-15 01:29:00,309 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-15 01:29:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2019-10-15 01:29:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5989. [2019-10-15 01:29:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5989 states. [2019-10-15 01:29:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 8620 transitions. [2019-10-15 01:29:00,645 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 8620 transitions. Word has length 149 [2019-10-15 01:29:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,646 INFO L462 AbstractCegarLoop]: Abstraction has 5989 states and 8620 transitions. [2019-10-15 01:29:00,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 8620 transitions. [2019-10-15 01:29:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:29:00,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,657 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:00,657 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2114375036, now seen corresponding path program 1 times [2019-10-15 01:29:00,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006403760] [2019-10-15 01:29:00,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:00,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006403760] [2019-10-15 01:29:00,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059455021] [2019-10-15 01:29:00,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:00,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:01,042 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:29:01,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:01,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-15 01:29:01,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575390223] [2019-10-15 01:29:01,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:01,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:01,170 INFO L87 Difference]: Start difference. First operand 5989 states and 8620 transitions. Second operand 3 states. [2019-10-15 01:29:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,716 INFO L93 Difference]: Finished difference Result 14627 states and 21375 transitions. [2019-10-15 01:29:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:29:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,752 INFO L225 Difference]: With dead ends: 14627 [2019-10-15 01:29:01,753 INFO L226 Difference]: Without dead ends: 8693 [2019-10-15 01:29:01,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8693 states. [2019-10-15 01:29:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8693 to 8420. [2019-10-15 01:29:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8420 states. [2019-10-15 01:29:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8420 states to 8420 states and 11979 transitions. [2019-10-15 01:29:02,264 INFO L78 Accepts]: Start accepts. Automaton has 8420 states and 11979 transitions. Word has length 149 [2019-10-15 01:29:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,265 INFO L462 AbstractCegarLoop]: Abstraction has 8420 states and 11979 transitions. [2019-10-15 01:29:02,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8420 states and 11979 transitions. [2019-10-15 01:29:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:29:02,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,275 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:02,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,484 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash 525995495, now seen corresponding path program 1 times [2019-10-15 01:29:02,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061188854] [2019-10-15 01:29:02,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:29:02,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061188854] [2019-10-15 01:29:02,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:02,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:02,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754400975] [2019-10-15 01:29:02,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:02,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:02,542 INFO L87 Difference]: Start difference. First operand 8420 states and 11979 transitions. Second operand 3 states. [2019-10-15 01:29:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,844 INFO L93 Difference]: Finished difference Result 15023 states and 21538 transitions. [2019-10-15 01:29:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:02,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:29:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,876 INFO L225 Difference]: With dead ends: 15023 [2019-10-15 01:29:02,876 INFO L226 Difference]: Without dead ends: 7231 [2019-10-15 01:29:02,896 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-15 01:29:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7231 states. [2019-10-15 01:29:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7231 to 7231. [2019-10-15 01:29:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7231 states. [2019-10-15 01:29:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 10414 transitions. [2019-10-15 01:29:03,419 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 10414 transitions. Word has length 161 [2019-10-15 01:29:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,419 INFO L462 AbstractCegarLoop]: Abstraction has 7231 states and 10414 transitions. [2019-10-15 01:29:03,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 10414 transitions. [2019-10-15 01:29:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:29:03,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,430 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:03,430 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -920585371, now seen corresponding path program 1 times [2019-10-15 01:29:03,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867604281] [2019-10-15 01:29:03,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:03,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867604281] [2019-10-15 01:29:03,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342243621] [2019-10-15 01:29:03,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:03,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:29:03,831 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:29:03,910 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:03,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:29:03,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107617274] [2019-10-15 01:29:03,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:03,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:03,912 INFO L87 Difference]: Start difference. First operand 7231 states and 10414 transitions. Second operand 3 states. [2019-10-15 01:29:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,603 INFO L93 Difference]: Finished difference Result 18644 states and 27873 transitions. [2019-10-15 01:29:04,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:04,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:29:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,662 INFO L225 Difference]: With dead ends: 18644 [2019-10-15 01:29:04,662 INFO L226 Difference]: Without dead ends: 11449 [2019-10-15 01:29:04,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2019-10-15 01:29:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 11262. [2019-10-15 01:29:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11262 states. [2019-10-15 01:29:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11262 states to 11262 states and 16182 transitions. [2019-10-15 01:29:05,999 INFO L78 Accepts]: Start accepts. Automaton has 11262 states and 16182 transitions. Word has length 161 [2019-10-15 01:29:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,999 INFO L462 AbstractCegarLoop]: Abstraction has 11262 states and 16182 transitions. [2019-10-15 01:29:05,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11262 states and 16182 transitions. [2019-10-15 01:29:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:29:06,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,018 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:06,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,223 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -616879195, now seen corresponding path program 1 times [2019-10-15 01:29:06,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874934908] [2019-10-15 01:29:06,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:06,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874934908] [2019-10-15 01:29:06,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22810149] [2019-10-15 01:29:06,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:06,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:06,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:06,582 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:06,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:29:06,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765272147] [2019-10-15 01:29:06,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:06,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:06,584 INFO L87 Difference]: Start difference. First operand 11262 states and 16182 transitions. Second operand 3 states. [2019-10-15 01:29:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,322 INFO L93 Difference]: Finished difference Result 28107 states and 41196 transitions. [2019-10-15 01:29:07,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:07,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:29:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,406 INFO L225 Difference]: With dead ends: 28107 [2019-10-15 01:29:07,407 INFO L226 Difference]: Without dead ends: 17713 [2019-10-15 01:29:07,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17713 states. [2019-10-15 01:29:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17713 to 17674. [2019-10-15 01:29:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17674 states. [2019-10-15 01:29:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17674 states to 17674 states and 25308 transitions. [2019-10-15 01:29:08,459 INFO L78 Accepts]: Start accepts. Automaton has 17674 states and 25308 transitions. Word has length 162 [2019-10-15 01:29:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,459 INFO L462 AbstractCegarLoop]: Abstraction has 17674 states and 25308 transitions. [2019-10-15 01:29:08,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17674 states and 25308 transitions. [2019-10-15 01:29:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:29:08,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,486 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:08,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:08,690 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1606895040, now seen corresponding path program 1 times [2019-10-15 01:29:08,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995335919] [2019-10-15 01:29:08,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:08,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995335919] [2019-10-15 01:29:08,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414188668] [2019-10-15 01:29:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:08,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:29:08,928 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:29:08,987 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:08,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:29:08,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705495538] [2019-10-15 01:29:08,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:08,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:08,989 INFO L87 Difference]: Start difference. First operand 17674 states and 25308 transitions. Second operand 3 states. [2019-10-15 01:29:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,569 INFO L93 Difference]: Finished difference Result 45628 states and 66732 transitions. [2019-10-15 01:29:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:10,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-15 01:29:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,680 INFO L225 Difference]: With dead ends: 45628 [2019-10-15 01:29:10,680 INFO L226 Difference]: Without dead ends: 28025 [2019-10-15 01:29:10,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2019-10-15 01:29:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 28022. [2019-10-15 01:29:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28022 states. [2019-10-15 01:29:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28022 states to 28022 states and 39265 transitions. [2019-10-15 01:29:12,117 INFO L78 Accepts]: Start accepts. Automaton has 28022 states and 39265 transitions. Word has length 163 [2019-10-15 01:29:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:12,118 INFO L462 AbstractCegarLoop]: Abstraction has 28022 states and 39265 transitions. [2019-10-15 01:29:12,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28022 states and 39265 transitions. [2019-10-15 01:29:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:29:12,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:12,147 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]