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_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:34,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:34,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:34,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:34,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:34,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:34,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:34,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:34,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:34,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:34,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:34,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:34,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:34,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:34,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:34,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:34,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:34,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:34,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:34,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:34,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:34,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:34,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:34,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:34,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:34,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:34,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:34,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:34,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:34,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:34,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:34,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:34,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:34,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:34,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:34,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:34,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:34,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:34,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:34,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:34,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:34,178 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:23:34,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:34,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:34,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:34,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:34,214 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:34,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:34,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:34,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:34,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:34,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:34,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:34,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:34,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:34,218 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:34,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:34,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:34,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:34,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:34,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:34,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:34,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:34,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:34,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:34,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:34,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:34,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:34,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:34,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:34,222 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:23:34,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:34,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:34,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:34,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:34,515 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:34,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:34,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec57ddc44/7d958e7e204f4d2fa7561d9a48faaa37/FLAG08ed81421 [2019-10-13 21:23:35,128 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:35,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:35,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec57ddc44/7d958e7e204f4d2fa7561d9a48faaa37/FLAG08ed81421 [2019-10-13 21:23:35,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec57ddc44/7d958e7e204f4d2fa7561d9a48faaa37 [2019-10-13 21:23:35,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:35,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:35,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:35,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:35,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:35,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:35" (1/1) ... [2019-10-13 21:23:35,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6a6dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:35, skipping insertion in model container [2019-10-13 21:23:35,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:35" (1/1) ... [2019-10-13 21:23:35,460 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:35,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:36,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:36,025 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:36,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:36,146 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:36,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36 WrapperNode [2019-10-13 21:23:36,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:36,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:36,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:36,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:36,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:36,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:36,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:36,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:36,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (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:23:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:37,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:37,442 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:37,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:37 BoogieIcfgContainer [2019-10-13 21:23:37,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:37,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:37,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:37,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:37,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:35" (1/3) ... [2019-10-13 21:23:37,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154d9b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:37, skipping insertion in model container [2019-10-13 21:23:37,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (2/3) ... [2019-10-13 21:23:37,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154d9b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:37, skipping insertion in model container [2019-10-13 21:23:37,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:37" (3/3) ... [2019-10-13 21:23:37,453 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:37,463 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:37,472 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:37,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:37,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:37,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:37,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:37,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:37,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:37,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:37,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:37,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-13 21:23:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:23:37,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:37,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:37,579 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1231650886, now seen corresponding path program 1 times [2019-10-13 21:23:37,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:37,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488519495] [2019-10-13 21:23:37,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,264 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:23:38,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488519495] [2019-10-13 21:23:38,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:38,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589499029] [2019-10-13 21:23:38,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:38,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:38,291 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 4 states. [2019-10-13 21:23:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:38,535 INFO L93 Difference]: Finished difference Result 654 states and 1145 transitions. [2019-10-13 21:23:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:38,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-13 21:23:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:38,555 INFO L225 Difference]: With dead ends: 654 [2019-10-13 21:23:38,556 INFO L226 Difference]: Without dead ends: 430 [2019-10-13 21:23:38,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-13 21:23:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2019-10-13 21:23:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-13 21:23:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-13 21:23:38,659 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 99 [2019-10-13 21:23:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:38,659 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-13 21:23:38,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-13 21:23:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:23:38,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,665 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:38,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 829692944, now seen corresponding path program 1 times [2019-10-13 21:23:38,666 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426988497] [2019-10-13 21:23:38,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,787 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:23:38,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426988497] [2019-10-13 21:23:38,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:38,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312044038] [2019-10-13 21:23:38,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:38,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:38,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:38,793 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 3 states. [2019-10-13 21:23:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:38,873 INFO L93 Difference]: Finished difference Result 1238 states and 1811 transitions. [2019-10-13 21:23:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:38,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-13 21:23:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:38,880 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 21:23:38,880 INFO L226 Difference]: Without dead ends: 842 [2019-10-13 21:23:38,884 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:23:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-13 21:23:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 430. [2019-10-13 21:23:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-10-13 21:23:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2019-10-13 21:23:38,927 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 100 [2019-10-13 21:23:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:38,928 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2019-10-13 21:23:38,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2019-10-13 21:23:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:23:38,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:38,931 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1677637145, now seen corresponding path program 1 times [2019-10-13 21:23:38,932 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982371128] [2019-10-13 21:23:38,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,179 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:23:39,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982371128] [2019-10-13 21:23:39,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:39,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611597190] [2019-10-13 21:23:39,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:39,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:39,189 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand 4 states. [2019-10-13 21:23:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:39,255 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2019-10-13 21:23:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:39,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-13 21:23:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:39,260 INFO L225 Difference]: With dead ends: 846 [2019-10-13 21:23:39,260 INFO L226 Difference]: Without dead ends: 428 [2019-10-13 21:23:39,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-10-13 21:23:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-10-13 21:23:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-13 21:23:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2019-10-13 21:23:39,294 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 101 [2019-10-13 21:23:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:39,296 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2019-10-13 21:23:39,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2019-10-13 21:23:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:23:39,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:39,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1471843135, now seen corresponding path program 1 times [2019-10-13 21:23:39,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504977701] [2019-10-13 21:23:39,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,431 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:23:39,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504977701] [2019-10-13 21:23:39,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:39,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470423418] [2019-10-13 21:23:39,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:39,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:39,435 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 3 states. [2019-10-13 21:23:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:39,511 INFO L93 Difference]: Finished difference Result 881 states and 1305 transitions. [2019-10-13 21:23:39,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:39,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-13 21:23:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:39,516 INFO L225 Difference]: With dead ends: 881 [2019-10-13 21:23:39,516 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:23:39,517 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:23:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:23:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-10-13 21:23:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:23:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2019-10-13 21:23:39,581 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 101 [2019-10-13 21:23:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:39,582 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2019-10-13 21:23:39,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2019-10-13 21:23:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:23:39,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:39,585 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1316339424, now seen corresponding path program 1 times [2019-10-13 21:23:39,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799585898] [2019-10-13 21:23:39,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:39,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799585898] [2019-10-13 21:23:39,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:23:39,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137748683] [2019-10-13 21:23:39,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:39,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:39,774 INFO L87 Difference]: Start difference. First operand 629 states and 910 transitions. Second operand 5 states. [2019-10-13 21:23:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,057 INFO L93 Difference]: Finished difference Result 1413 states and 2116 transitions. [2019-10-13 21:23:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:40,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 21:23:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,064 INFO L225 Difference]: With dead ends: 1413 [2019-10-13 21:23:40,064 INFO L226 Difference]: Without dead ends: 952 [2019-10-13 21:23:40,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:23:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-13 21:23:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-13 21:23:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-13 21:23:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1405 transitions. [2019-10-13 21:23:40,129 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1405 transitions. Word has length 103 [2019-10-13 21:23:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,130 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1405 transitions. [2019-10-13 21:23:40,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:23:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1405 transitions. [2019-10-13 21:23:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:23:40,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 822354405, now seen corresponding path program 1 times [2019-10-13 21:23:40,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371811070] [2019-10-13 21:23:40,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,298 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:23:40,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371811070] [2019-10-13 21:23:40,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:40,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103789122] [2019-10-13 21:23:40,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:40,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:40,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:40,301 INFO L87 Difference]: Start difference. First operand 950 states and 1405 transitions. Second operand 4 states. [2019-10-13 21:23:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,455 INFO L93 Difference]: Finished difference Result 2380 states and 3527 transitions. [2019-10-13 21:23:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:40,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-13 21:23:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,463 INFO L225 Difference]: With dead ends: 2380 [2019-10-13 21:23:40,464 INFO L226 Difference]: Without dead ends: 1453 [2019-10-13 21:23:40,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-13 21:23:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1451. [2019-10-13 21:23:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-13 21:23:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2130 transitions. [2019-10-13 21:23:40,574 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2130 transitions. Word has length 103 [2019-10-13 21:23:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,575 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2130 transitions. [2019-10-13 21:23:40,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2130 transitions. [2019-10-13 21:23:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:23:40,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1353908859, now seen corresponding path program 1 times [2019-10-13 21:23:40,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052887631] [2019-10-13 21:23:40,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,763 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:23:40,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052887631] [2019-10-13 21:23:40,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:40,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442194036] [2019-10-13 21:23:40,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:40,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:40,767 INFO L87 Difference]: Start difference. First operand 1451 states and 2130 transitions. Second operand 4 states. [2019-10-13 21:23:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,919 INFO L93 Difference]: Finished difference Result 2511 states and 3707 transitions. [2019-10-13 21:23:40,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:40,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 21:23:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,927 INFO L225 Difference]: With dead ends: 2511 [2019-10-13 21:23:40,928 INFO L226 Difference]: Without dead ends: 1451 [2019-10-13 21:23:40,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-13 21:23:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2019-10-13 21:23:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-13 21:23:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2129 transitions. [2019-10-13 21:23:41,029 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2129 transitions. Word has length 105 [2019-10-13 21:23:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,029 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2129 transitions. [2019-10-13 21:23:41,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2129 transitions. [2019-10-13 21:23:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:23:41,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,032 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:41,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,033 INFO L82 PathProgramCache]: Analyzing trace with hash -673168968, now seen corresponding path program 1 times [2019-10-13 21:23:41,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694898489] [2019-10-13 21:23:41,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,116 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:23:41,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694898489] [2019-10-13 21:23:41,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:41,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826525743] [2019-10-13 21:23:41,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:41,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:41,119 INFO L87 Difference]: Start difference. First operand 1451 states and 2129 transitions. Second operand 3 states. [2019-10-13 21:23:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,278 INFO L93 Difference]: Finished difference Result 3308 states and 4930 transitions. [2019-10-13 21:23:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:41,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-13 21:23:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,290 INFO L225 Difference]: With dead ends: 3308 [2019-10-13 21:23:41,290 INFO L226 Difference]: Without dead ends: 2200 [2019-10-13 21:23:41,294 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:23:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-10-13 21:23:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2198. [2019-10-13 21:23:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-13 21:23:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3202 transitions. [2019-10-13 21:23:41,471 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3202 transitions. Word has length 105 [2019-10-13 21:23:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,473 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 3202 transitions. [2019-10-13 21:23:41,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3202 transitions. [2019-10-13 21:23:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:23:41,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:41,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -312373315, now seen corresponding path program 1 times [2019-10-13 21:23:41,477 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464066831] [2019-10-13 21:23:41,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,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-13 21:23:41,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464066831] [2019-10-13 21:23:41,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:41,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476129270] [2019-10-13 21:23:41,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:41,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:41,668 INFO L87 Difference]: Start difference. First operand 2198 states and 3202 transitions. Second operand 4 states. [2019-10-13 21:23:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:42,125 INFO L93 Difference]: Finished difference Result 6352 states and 9243 transitions. [2019-10-13 21:23:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:42,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:23:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,157 INFO L225 Difference]: With dead ends: 6352 [2019-10-13 21:23:42,157 INFO L226 Difference]: Without dead ends: 4197 [2019-10-13 21:23:42,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-10-13 21:23:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4195. [2019-10-13 21:23:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-13 21:23:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6052 transitions. [2019-10-13 21:23:42,507 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6052 transitions. Word has length 107 [2019-10-13 21:23:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,507 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6052 transitions. [2019-10-13 21:23:42,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6052 transitions. [2019-10-13 21:23:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:23:42,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:42,513 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1907705071, now seen corresponding path program 1 times [2019-10-13 21:23:42,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838718787] [2019-10-13 21:23:42,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,574 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:23:42,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838718787] [2019-10-13 21:23:42,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:42,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583561202] [2019-10-13 21:23:42,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:42,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:42,578 INFO L87 Difference]: Start difference. First operand 4195 states and 6052 transitions. Second operand 3 states. [2019-10-13 21:23:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:43,102 INFO L93 Difference]: Finished difference Result 12393 states and 17909 transitions. [2019-10-13 21:23:43,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:43,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-13 21:23:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:43,145 INFO L225 Difference]: With dead ends: 12393 [2019-10-13 21:23:43,145 INFO L226 Difference]: Without dead ends: 8303 [2019-10-13 21:23:43,165 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:23:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-10-13 21:23:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 4201. [2019-10-13 21:23:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-10-13 21:23:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6058 transitions. [2019-10-13 21:23:43,731 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6058 transitions. Word has length 108 [2019-10-13 21:23:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:43,732 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 6058 transitions. [2019-10-13 21:23:43,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6058 transitions. [2019-10-13 21:23:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:23:43,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:43,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:43,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1358405212, now seen corresponding path program 1 times [2019-10-13 21:23:43,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:43,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106224276] [2019-10-13 21:23:43,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:43,894 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:23:43,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106224276] [2019-10-13 21:23:43,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:43,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:43,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309718563] [2019-10-13 21:23:43,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:43,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:43,896 INFO L87 Difference]: Start difference. First operand 4201 states and 6058 transitions. Second operand 4 states. [2019-10-13 21:23:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:44,193 INFO L93 Difference]: Finished difference Result 8360 states and 12060 transitions. [2019-10-13 21:23:44,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:44,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 21:23:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:44,234 INFO L225 Difference]: With dead ends: 8360 [2019-10-13 21:23:44,235 INFO L226 Difference]: Without dead ends: 4195 [2019-10-13 21:23:44,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-13 21:23:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-13 21:23:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-13 21:23:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6046 transitions. [2019-10-13 21:23:44,602 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6046 transitions. Word has length 109 [2019-10-13 21:23:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:44,602 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6046 transitions. [2019-10-13 21:23:44,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6046 transitions. [2019-10-13 21:23:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:23:44,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:44,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:44,608 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 825640158, now seen corresponding path program 1 times [2019-10-13 21:23:44,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:44,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816764427] [2019-10-13 21:23:44,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:44,707 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:23:44,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816764427] [2019-10-13 21:23:44,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:44,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:44,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321954788] [2019-10-13 21:23:44,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:44,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:44,709 INFO L87 Difference]: Start difference. First operand 4195 states and 6046 transitions. Second operand 3 states. [2019-10-13 21:23:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:45,105 INFO L93 Difference]: Finished difference Result 9753 states and 14169 transitions. [2019-10-13 21:23:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:45,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-13 21:23:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:45,121 INFO L225 Difference]: With dead ends: 9753 [2019-10-13 21:23:45,122 INFO L226 Difference]: Without dead ends: 6233 [2019-10-13 21:23:45,132 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:23:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2019-10-13 21:23:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6231. [2019-10-13 21:23:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-10-13 21:23:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8841 transitions. [2019-10-13 21:23:45,613 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8841 transitions. Word has length 109 [2019-10-13 21:23:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:45,614 INFO L462 AbstractCegarLoop]: Abstraction has 6231 states and 8841 transitions. [2019-10-13 21:23:45,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8841 transitions. [2019-10-13 21:23:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:23:45,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:45,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,626 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 200750214, now seen corresponding path program 1 times [2019-10-13 21:23:45,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:45,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684764890] [2019-10-13 21:23:45,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:45,982 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:23:45,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684764890] [2019-10-13 21:23:45,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:45,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:23:45,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260072644] [2019-10-13 21:23:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:23:45,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:23:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:23:45,985 INFO L87 Difference]: Start difference. First operand 6231 states and 8841 transitions. Second operand 12 states. [2019-10-13 21:23:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:48,650 INFO L93 Difference]: Finished difference Result 17888 states and 26756 transitions. [2019-10-13 21:23:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:23:48,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-10-13 21:23:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:48,683 INFO L225 Difference]: With dead ends: 17888 [2019-10-13 21:23:48,683 INFO L226 Difference]: Without dead ends: 13847 [2019-10-13 21:23:48,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:23:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-10-13 21:23:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 12191. [2019-10-13 21:23:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2019-10-13 21:23:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 17824 transitions. [2019-10-13 21:23:49,606 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 17824 transitions. Word has length 111 [2019-10-13 21:23:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:49,607 INFO L462 AbstractCegarLoop]: Abstraction has 12191 states and 17824 transitions. [2019-10-13 21:23:49,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:23:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 17824 transitions. [2019-10-13 21:23:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:23:49,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:49,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:49,618 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:49,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash -825612106, now seen corresponding path program 1 times [2019-10-13 21:23:49,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:49,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850338683] [2019-10-13 21:23:49,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:49,697 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:23:49,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850338683] [2019-10-13 21:23:49,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:49,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:49,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689326148] [2019-10-13 21:23:49,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:49,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:49,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:49,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:49,699 INFO L87 Difference]: Start difference. First operand 12191 states and 17824 transitions. Second operand 3 states. [2019-10-13 21:23:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:51,737 INFO L93 Difference]: Finished difference Result 28778 states and 44113 transitions. [2019-10-13 21:23:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:51,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:23:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:51,790 INFO L225 Difference]: With dead ends: 28778 [2019-10-13 21:23:51,790 INFO L226 Difference]: Without dead ends: 20474 [2019-10-13 21:23:51,810 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:23:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-10-13 21:23:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20448. [2019-10-13 21:23:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20448 states. [2019-10-13 21:23:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20448 states to 20448 states and 30546 transitions. [2019-10-13 21:23:53,229 INFO L78 Accepts]: Start accepts. Automaton has 20448 states and 30546 transitions. Word has length 111 [2019-10-13 21:23:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,229 INFO L462 AbstractCegarLoop]: Abstraction has 20448 states and 30546 transitions. [2019-10-13 21:23:53,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20448 states and 30546 transitions. [2019-10-13 21:23:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:23:53,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,239 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1946924417, now seen corresponding path program 1 times [2019-10-13 21:23:53,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102482491] [2019-10-13 21:23:53,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102482491] [2019-10-13 21:23:53,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:53,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812623283] [2019-10-13 21:23:53,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:53,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:53,430 INFO L87 Difference]: Start difference. First operand 20448 states and 30546 transitions. Second operand 8 states. [2019-10-13 21:23:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,683 INFO L93 Difference]: Finished difference Result 37536 states and 57114 transitions. [2019-10-13 21:23:54,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:54,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-10-13 21:23:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,732 INFO L225 Difference]: With dead ends: 37536 [2019-10-13 21:23:54,733 INFO L226 Difference]: Without dead ends: 20450 [2019-10-13 21:23:54,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20450 states. [2019-10-13 21:23:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20450 to 13342. [2019-10-13 21:23:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13342 states. [2019-10-13 21:23:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13342 states to 13342 states and 19521 transitions. [2019-10-13 21:23:55,827 INFO L78 Accepts]: Start accepts. Automaton has 13342 states and 19521 transitions. Word has length 111 [2019-10-13 21:23:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,828 INFO L462 AbstractCegarLoop]: Abstraction has 13342 states and 19521 transitions. [2019-10-13 21:23:55,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13342 states and 19521 transitions. [2019-10-13 21:23:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:23:55,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,841 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 178287398, now seen corresponding path program 1 times [2019-10-13 21:23:55,842 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892988125] [2019-10-13 21:23:55,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,985 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:23:55,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892988125] [2019-10-13 21:23:55,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:55,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358463410] [2019-10-13 21:23:55,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:55,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:55,994 INFO L87 Difference]: Start difference. First operand 13342 states and 19521 transitions. Second operand 4 states. [2019-10-13 21:23:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,130 INFO L93 Difference]: Finished difference Result 25341 states and 37116 transitions. [2019-10-13 21:23:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:57,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:23:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,161 INFO L225 Difference]: With dead ends: 25341 [2019-10-13 21:23:57,161 INFO L226 Difference]: Without dead ends: 12319 [2019-10-13 21:23:57,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12319 states. [2019-10-13 21:23:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12319 to 12276. [2019-10-13 21:23:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12276 states. [2019-10-13 21:23:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12276 states to 12276 states and 17910 transitions. [2019-10-13 21:23:57,984 INFO L78 Accepts]: Start accepts. Automaton has 12276 states and 17910 transitions. Word has length 111 [2019-10-13 21:23:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,984 INFO L462 AbstractCegarLoop]: Abstraction has 12276 states and 17910 transitions. [2019-10-13 21:23:57,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12276 states and 17910 transitions. [2019-10-13 21:23:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:23:57,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,995 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 40427157, now seen corresponding path program 1 times [2019-10-13 21:23:57,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425579381] [2019-10-13 21:23:57,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,126 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:23:58,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425579381] [2019-10-13 21:23:58,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:58,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970724514] [2019-10-13 21:23:58,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:58,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:58,128 INFO L87 Difference]: Start difference. First operand 12276 states and 17910 transitions. Second operand 4 states. [2019-10-13 21:23:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,221 INFO L93 Difference]: Finished difference Result 24617 states and 35905 transitions. [2019-10-13 21:23:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:59,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:23:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:59,244 INFO L225 Difference]: With dead ends: 24617 [2019-10-13 21:23:59,244 INFO L226 Difference]: Without dead ends: 12494 [2019-10-13 21:23:59,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:23:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12494 states. [2019-10-13 21:24:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12494 to 12388. [2019-10-13 21:24:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-10-13 21:24:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 18026 transitions. [2019-10-13 21:24:00,039 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 18026 transitions. Word has length 113 [2019-10-13 21:24:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,040 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 18026 transitions. [2019-10-13 21:24:00,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 18026 transitions. [2019-10-13 21:24:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:00,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,047 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,048 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1035262953, now seen corresponding path program 1 times [2019-10-13 21:24:00,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904863421] [2019-10-13 21:24:00,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:00,093 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:00,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904863421] [2019-10-13 21:24:00,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:00,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:00,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871992064] [2019-10-13 21:24:00,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:00,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:00,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:00,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:00,095 INFO L87 Difference]: Start difference. First operand 12388 states and 18026 transitions. Second operand 3 states. [2019-10-13 21:24:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:01,515 INFO L93 Difference]: Finished difference Result 33523 states and 48997 transitions. [2019-10-13 21:24:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:01,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-13 21:24:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:01,546 INFO L225 Difference]: With dead ends: 33523 [2019-10-13 21:24:01,546 INFO L226 Difference]: Without dead ends: 24574 [2019-10-13 21:24:01,564 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:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24574 states. [2019-10-13 21:24:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24574 to 12398. [2019-10-13 21:24:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-10-13 21:24:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 18036 transitions. [2019-10-13 21:24:02,613 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 18036 transitions. Word has length 114 [2019-10-13 21:24:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,613 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 18036 transitions. [2019-10-13 21:24:02,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 18036 transitions. [2019-10-13 21:24:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:24:02,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,620 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,620 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1791064046, now seen corresponding path program 1 times [2019-10-13 21:24:02,621 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210005912] [2019-10-13 21:24:02,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:02,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210005912] [2019-10-13 21:24:02,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:02,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138768066] [2019-10-13 21:24:02,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:02,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:02,759 INFO L87 Difference]: Start difference. First operand 12398 states and 18036 transitions. Second operand 4 states. [2019-10-13 21:24:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:03,688 INFO L93 Difference]: Finished difference Result 24950 states and 36255 transitions. [2019-10-13 21:24:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:03,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 21:24:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:03,702 INFO L225 Difference]: With dead ends: 24950 [2019-10-13 21:24:03,702 INFO L226 Difference]: Without dead ends: 12854 [2019-10-13 21:24:03,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:24:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12854 states. [2019-10-13 21:24:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12854 to 12658. [2019-10-13 21:24:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12658 states. [2019-10-13 21:24:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12658 states to 12658 states and 18312 transitions. [2019-10-13 21:24:04,673 INFO L78 Accepts]: Start accepts. Automaton has 12658 states and 18312 transitions. Word has length 115 [2019-10-13 21:24:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:04,673 INFO L462 AbstractCegarLoop]: Abstraction has 12658 states and 18312 transitions. [2019-10-13 21:24:04,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12658 states and 18312 transitions. [2019-10-13 21:24:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:24:04,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:04,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,678 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 782372148, now seen corresponding path program 1 times [2019-10-13 21:24:04,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:04,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462089726] [2019-10-13 21:24:04,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:04,782 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:04,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462089726] [2019-10-13 21:24:04,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:04,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:04,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623643832] [2019-10-13 21:24:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:04,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:04,784 INFO L87 Difference]: Start difference. First operand 12658 states and 18312 transitions. Second operand 4 states. [2019-10-13 21:24:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,511 INFO L93 Difference]: Finished difference Result 17586 states and 25597 transitions. [2019-10-13 21:24:05,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:05,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 21:24:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,527 INFO L225 Difference]: With dead ends: 17586 [2019-10-13 21:24:05,528 INFO L226 Difference]: Without dead ends: 10973 [2019-10-13 21:24:05,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 21:24:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10973 states. [2019-10-13 21:24:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10973 to 10970. [2019-10-13 21:24:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2019-10-13 21:24:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 15839 transitions. [2019-10-13 21:24:06,432 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 15839 transitions. Word has length 115 [2019-10-13 21:24:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:06,432 INFO L462 AbstractCegarLoop]: Abstraction has 10970 states and 15839 transitions. [2019-10-13 21:24:06,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 15839 transitions. [2019-10-13 21:24:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:24:06,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:06,437 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,437 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:06,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1332721599, now seen corresponding path program 1 times [2019-10-13 21:24:06,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:06,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797587925] [2019-10-13 21:24:06,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:06,575 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:06,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797587925] [2019-10-13 21:24:06,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:06,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:06,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310794827] [2019-10-13 21:24:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:06,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:06,578 INFO L87 Difference]: Start difference. First operand 10970 states and 15839 transitions. Second operand 6 states. [2019-10-13 21:24:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:08,746 INFO L93 Difference]: Finished difference Result 36582 states and 54585 transitions. [2019-10-13 21:24:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:08,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:24:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:08,781 INFO L225 Difference]: With dead ends: 36582 [2019-10-13 21:24:08,782 INFO L226 Difference]: Without dead ends: 26922 [2019-10-13 21:24:08,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26922 states.