java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:12,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:12,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:12,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:12,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:12,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:12,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:12,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:12,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:12,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:12,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:12,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:12,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:12,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:12,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:12,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:12,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:12,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:12,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:12,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:12,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:12,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:12,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:12,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:12,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:12,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:12,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:12,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:12,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:12,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:12,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:12,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:12,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:12,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:12,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:12,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:12,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:12,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:12,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:12,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:12,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:12,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:24:12,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:12,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:12,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:12,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:12,147 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:12,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:12,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:12,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:12,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:12,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:12,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:12,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:12,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:12,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:12,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:12,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:12,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:12,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:12,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:12,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:12,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:12,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:12,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:12,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:12,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:12,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:12,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:12,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:12,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:12,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:12,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:12,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:12,488 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:12,489 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:12,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:12,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe131d72/b156af7e3e304a2eb3706125bd0342ea/FLAGfd9ce06cb [2019-10-13 21:24:13,248 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:13,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:13,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe131d72/b156af7e3e304a2eb3706125bd0342ea/FLAGfd9ce06cb [2019-10-13 21:24:13,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe131d72/b156af7e3e304a2eb3706125bd0342ea [2019-10-13 21:24:13,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:13,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:13,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:13,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:13,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:13,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad4c578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:13, skipping insertion in model container [2019-10-13 21:24:13,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,532 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:13,648 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:14,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:14,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:14,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:14,643 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:14,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14 WrapperNode [2019-10-13 21:24:14,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:14,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:14,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:14,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:14,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:14,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:14,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:14,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:14,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:14,920 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:14,920 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:14,920 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:17,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:17,065 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:17,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:17 BoogieIcfgContainer [2019-10-13 21:24:17,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:17,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:17,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:17,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:13" (1/3) ... [2019-10-13 21:24:17,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9eaad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:17, skipping insertion in model container [2019-10-13 21:24:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14" (2/3) ... [2019-10-13 21:24:17,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9eaad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:17, skipping insertion in model container [2019-10-13 21:24:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:17" (3/3) ... [2019-10-13 21:24:17,075 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:17,085 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:17,111 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 21:24:17,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 21:24:17,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:17,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:17,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:17,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:17,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:17,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:17,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:17,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states. [2019-10-13 21:24:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:24:17,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:17,245 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:17,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash -437253728, now seen corresponding path program 1 times [2019-10-13 21:24:17,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:17,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840710416] [2019-10-13 21:24:17,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:17,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840710416] [2019-10-13 21:24:17,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:17,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:17,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360016488] [2019-10-13 21:24:17,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:17,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:17,783 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 3 states. [2019-10-13 21:24:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,961 INFO L93 Difference]: Finished difference Result 701 states and 1229 transitions. [2019-10-13 21:24:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:17,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-13 21:24:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:17,984 INFO L225 Difference]: With dead ends: 701 [2019-10-13 21:24:17,984 INFO L226 Difference]: Without dead ends: 544 [2019-10-13 21:24:17,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-13 21:24:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2019-10-13 21:24:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-13 21:24:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2019-10-13 21:24:18,107 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 53 [2019-10-13 21:24:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:18,108 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2019-10-13 21:24:18,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2019-10-13 21:24:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:24:18,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:18,113 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:18,113 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash 511312781, now seen corresponding path program 1 times [2019-10-13 21:24:18,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:18,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884935669] [2019-10-13 21:24:18,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:18,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884935669] [2019-10-13 21:24:18,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:18,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:18,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050340028] [2019-10-13 21:24:18,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:18,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:18,309 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand 3 states. [2019-10-13 21:24:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:18,371 INFO L93 Difference]: Finished difference Result 939 states and 1299 transitions. [2019-10-13 21:24:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:18,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-13 21:24:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:18,376 INFO L225 Difference]: With dead ends: 939 [2019-10-13 21:24:18,376 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:24:18,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:24:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-10-13 21:24:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-13 21:24:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 964 transitions. [2019-10-13 21:24:18,405 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 964 transitions. Word has length 53 [2019-10-13 21:24:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:18,406 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 964 transitions. [2019-10-13 21:24:18,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 964 transitions. [2019-10-13 21:24:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:24:18,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:18,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:18,409 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2083769958, now seen corresponding path program 1 times [2019-10-13 21:24:18,409 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:18,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684997672] [2019-10-13 21:24:18,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:18,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684997672] [2019-10-13 21:24:18,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:18,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:18,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229569787] [2019-10-13 21:24:18,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:18,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:18,653 INFO L87 Difference]: Start difference. First operand 711 states and 964 transitions. Second operand 10 states. [2019-10-13 21:24:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:20,724 INFO L93 Difference]: Finished difference Result 2245 states and 3240 transitions. [2019-10-13 21:24:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:20,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-13 21:24:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:20,736 INFO L225 Difference]: With dead ends: 2245 [2019-10-13 21:24:20,736 INFO L226 Difference]: Without dead ends: 2114 [2019-10-13 21:24:20,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:24:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-13 21:24:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 722. [2019-10-13 21:24:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-13 21:24:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2019-10-13 21:24:20,796 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 53 [2019-10-13 21:24:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:20,796 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2019-10-13 21:24:20,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2019-10-13 21:24:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:24:20,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:20,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:20,800 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -952135619, now seen corresponding path program 1 times [2019-10-13 21:24:20,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:20,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264442357] [2019-10-13 21:24:20,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:20,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264442357] [2019-10-13 21:24:20,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:20,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:20,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675584889] [2019-10-13 21:24:20,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:20,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:20,899 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand 3 states. [2019-10-13 21:24:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:21,090 INFO L93 Difference]: Finished difference Result 1389 states and 1943 transitions. [2019-10-13 21:24:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:21,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 21:24:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:21,098 INFO L225 Difference]: With dead ends: 1389 [2019-10-13 21:24:21,098 INFO L226 Difference]: Without dead ends: 1060 [2019-10-13 21:24:21,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-13 21:24:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1053. [2019-10-13 21:24:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-13 21:24:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-13 21:24:21,159 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-13 21:24:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,159 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-13 21:24:21,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-13 21:24:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:24:21,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:21,163 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1058176550, now seen corresponding path program 1 times [2019-10-13 21:24:21,164 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810580425] [2019-10-13 21:24:21,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:21,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810580425] [2019-10-13 21:24:21,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:21,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683103233] [2019-10-13 21:24:21,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:21,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:21,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:21,333 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 10 states. [2019-10-13 21:24:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:22,844 INFO L93 Difference]: Finished difference Result 2584 states and 3635 transitions. [2019-10-13 21:24:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:24:22,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-13 21:24:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:22,858 INFO L225 Difference]: With dead ends: 2584 [2019-10-13 21:24:22,858 INFO L226 Difference]: Without dead ends: 2367 [2019-10-13 21:24:22,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:24:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-10-13 21:24:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1053. [2019-10-13 21:24:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-13 21:24:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-13 21:24:22,932 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-13 21:24:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:22,933 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-13 21:24:22,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-13 21:24:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:24:22,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:22,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:22,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -609407585, now seen corresponding path program 1 times [2019-10-13 21:24:22,936 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:22,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032309874] [2019-10-13 21:24:22,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:23,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032309874] [2019-10-13 21:24:23,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:23,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:24:23,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468607861] [2019-10-13 21:24:23,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:24:23,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:24:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:24:23,152 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 12 states. [2019-10-13 21:24:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:26,683 INFO L93 Difference]: Finished difference Result 3802 states and 5406 transitions. [2019-10-13 21:24:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:26,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-13 21:24:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:26,701 INFO L225 Difference]: With dead ends: 3802 [2019-10-13 21:24:26,701 INFO L226 Difference]: Without dead ends: 3604 [2019-10-13 21:24:26,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:24:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-10-13 21:24:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1069. [2019-10-13 21:24:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-13 21:24:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1467 transitions. [2019-10-13 21:24:26,821 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1467 transitions. Word has length 54 [2019-10-13 21:24:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:26,822 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1467 transitions. [2019-10-13 21:24:26,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:24:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1467 transitions. [2019-10-13 21:24:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:24:26,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:26,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:26,825 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 963049592, now seen corresponding path program 1 times [2019-10-13 21:24:26,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:26,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519243810] [2019-10-13 21:24:26,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:27,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519243810] [2019-10-13 21:24:27,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:27,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:27,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685463036] [2019-10-13 21:24:27,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:27,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:27,090 INFO L87 Difference]: Start difference. First operand 1069 states and 1467 transitions. Second operand 9 states. [2019-10-13 21:24:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,478 INFO L93 Difference]: Finished difference Result 4058 states and 5764 transitions. [2019-10-13 21:24:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:28,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 21:24:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:28,495 INFO L225 Difference]: With dead ends: 4058 [2019-10-13 21:24:28,495 INFO L226 Difference]: Without dead ends: 3298 [2019-10-13 21:24:28,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-10-13 21:24:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2389. [2019-10-13 21:24:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-10-13 21:24:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3394 transitions. [2019-10-13 21:24:28,720 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3394 transitions. Word has length 54 [2019-10-13 21:24:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:28,720 INFO L462 AbstractCegarLoop]: Abstraction has 2389 states and 3394 transitions. [2019-10-13 21:24:28,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3394 transitions. [2019-10-13 21:24:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:28,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:28,725 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:28,725 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1344826450, now seen corresponding path program 1 times [2019-10-13 21:24:28,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:28,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138171553] [2019-10-13 21:24:28,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:28,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138171553] [2019-10-13 21:24:28,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:28,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:28,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815542396] [2019-10-13 21:24:28,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:28,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:28,827 INFO L87 Difference]: Start difference. First operand 2389 states and 3394 transitions. Second operand 7 states. [2019-10-13 21:24:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:30,289 INFO L93 Difference]: Finished difference Result 7376 states and 10821 transitions. [2019-10-13 21:24:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:30,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-13 21:24:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:30,322 INFO L225 Difference]: With dead ends: 7376 [2019-10-13 21:24:30,322 INFO L226 Difference]: Without dead ends: 6979 [2019-10-13 21:24:30,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-13 21:24:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 2390. [2019-10-13 21:24:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-13 21:24:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3396 transitions. [2019-10-13 21:24:30,689 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3396 transitions. Word has length 55 [2019-10-13 21:24:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:30,690 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3396 transitions. [2019-10-13 21:24:30,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:24:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3396 transitions. [2019-10-13 21:24:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:30,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:30,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:30,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash 698198403, now seen corresponding path program 1 times [2019-10-13 21:24:30,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:30,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600576123] [2019-10-13 21:24:30,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:30,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600576123] [2019-10-13 21:24:30,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:30,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:30,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288004192] [2019-10-13 21:24:30,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:30,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:30,883 INFO L87 Difference]: Start difference. First operand 2390 states and 3396 transitions. Second operand 9 states. [2019-10-13 21:24:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:32,810 INFO L93 Difference]: Finished difference Result 6722 states and 9758 transitions. [2019-10-13 21:24:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:32,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 21:24:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:32,836 INFO L225 Difference]: With dead ends: 6722 [2019-10-13 21:24:32,837 INFO L226 Difference]: Without dead ends: 6171 [2019-10-13 21:24:32,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:24:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-10-13 21:24:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 2405. [2019-10-13 21:24:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-13 21:24:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3418 transitions. [2019-10-13 21:24:33,087 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3418 transitions. Word has length 55 [2019-10-13 21:24:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:33,088 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3418 transitions. [2019-10-13 21:24:33,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3418 transitions. [2019-10-13 21:24:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:33,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:33,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:33,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2110452651, now seen corresponding path program 1 times [2019-10-13 21:24:33,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:33,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054426284] [2019-10-13 21:24:33,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:33,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054426284] [2019-10-13 21:24:33,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:33,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:33,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030796366] [2019-10-13 21:24:33,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:33,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:33,175 INFO L87 Difference]: Start difference. First operand 2405 states and 3418 transitions. Second operand 6 states. [2019-10-13 21:24:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:34,122 INFO L93 Difference]: Finished difference Result 4138 states and 5959 transitions. [2019-10-13 21:24:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:34,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 21:24:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:34,144 INFO L225 Difference]: With dead ends: 4138 [2019-10-13 21:24:34,144 INFO L226 Difference]: Without dead ends: 2372 [2019-10-13 21:24:34,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-10-13 21:24:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1715. [2019-10-13 21:24:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-13 21:24:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-13 21:24:34,383 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-13 21:24:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:34,383 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-13 21:24:34,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-13 21:24:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:34,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:34,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1073379538, now seen corresponding path program 1 times [2019-10-13 21:24:34,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514505042] [2019-10-13 21:24:34,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:34,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514505042] [2019-10-13 21:24:34,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:34,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:34,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817867693] [2019-10-13 21:24:34,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:34,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:34,525 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 10 states. [2019-10-13 21:24:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,117 INFO L93 Difference]: Finished difference Result 8298 states and 11986 transitions. [2019-10-13 21:24:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:24:38,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-13 21:24:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,134 INFO L225 Difference]: With dead ends: 8298 [2019-10-13 21:24:38,134 INFO L226 Difference]: Without dead ends: 7766 [2019-10-13 21:24:38,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-10-13 21:24:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 1715. [2019-10-13 21:24:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-13 21:24:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-13 21:24:38,397 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-13 21:24:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:38,397 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-13 21:24:38,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-13 21:24:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:38,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:38,400 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:38,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash -603462302, now seen corresponding path program 1 times [2019-10-13 21:24:38,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:38,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505260023] [2019-10-13 21:24:38,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:38,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505260023] [2019-10-13 21:24:38,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:38,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329929238] [2019-10-13 21:24:38,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:38,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:38,527 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 9 states. [2019-10-13 21:24:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,269 INFO L93 Difference]: Finished difference Result 7723 states and 11113 transitions. [2019-10-13 21:24:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:40,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 21:24:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,283 INFO L225 Difference]: With dead ends: 7723 [2019-10-13 21:24:40,283 INFO L226 Difference]: Without dead ends: 6251 [2019-10-13 21:24:40,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-10-13 21:24:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4360. [2019-10-13 21:24:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2019-10-13 21:24:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6289 transitions. [2019-10-13 21:24:40,893 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6289 transitions. Word has length 55 [2019-10-13 21:24:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,893 INFO L462 AbstractCegarLoop]: Abstraction has 4360 states and 6289 transitions. [2019-10-13 21:24:40,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6289 transitions. [2019-10-13 21:24:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:40,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,898 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:40,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1551481955, now seen corresponding path program 1 times [2019-10-13 21:24:40,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107443220] [2019-10-13 21:24:40,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:40,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107443220] [2019-10-13 21:24:40,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:40,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:40,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445823280] [2019-10-13 21:24:40,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:40,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:40,994 INFO L87 Difference]: Start difference. First operand 4360 states and 6289 transitions. Second operand 9 states. [2019-10-13 21:24:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:45,263 INFO L93 Difference]: Finished difference Result 15997 states and 22784 transitions. [2019-10-13 21:24:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:45,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 21:24:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:45,291 INFO L225 Difference]: With dead ends: 15997 [2019-10-13 21:24:45,292 INFO L226 Difference]: Without dead ends: 14521 [2019-10-13 21:24:45,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:24:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2019-10-13 21:24:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 4374. [2019-10-13 21:24:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-13 21:24:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-13 21:24:46,103 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 55 [2019-10-13 21:24:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:46,103 INFO L462 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-13 21:24:46,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-13 21:24:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:46,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:46,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:46,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1949047105, now seen corresponding path program 1 times [2019-10-13 21:24:46,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:46,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347954832] [2019-10-13 21:24:46,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:46,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347954832] [2019-10-13 21:24:46,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:46,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:46,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323811265] [2019-10-13 21:24:46,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:46,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:46,199 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 7 states.