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-13a467a-m [2019-10-15 01:22:37,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:37,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:37,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:37,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:37,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:37,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:37,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:37,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:37,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:37,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:37,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:37,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:37,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:37,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:37,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:37,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:37,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:37,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:37,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:37,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:37,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:37,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:37,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:37,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:37,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:37,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:37,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:37,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:37,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:37,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:37,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:37,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:37,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:37,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:37,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:37,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:37,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:37,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:37,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:37,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:37,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:22:37,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:37,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:37,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:37,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:37,257 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:37,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:37,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:37,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:37,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:37,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:37,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:37,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:37,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:37,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:37,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:37,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:37,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:37,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:37,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:37,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:37,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:37,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:37,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:37,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:37,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:37,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:37,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:37,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:37,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:37,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:37,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:37,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:37,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:37,563 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:37,563 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-15 01:22:37,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d996219/b7e75089e73e4cf88bce573e65293305/FLAG2439d328c [2019-10-15 01:22:38,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:38,169 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-15 01:22:38,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d996219/b7e75089e73e4cf88bce573e65293305/FLAG2439d328c [2019-10-15 01:22:38,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d996219/b7e75089e73e4cf88bce573e65293305 [2019-10-15 01:22:38,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:38,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:38,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:38,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:38,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:38,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392121d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:38, skipping insertion in model container [2019-10-15 01:22:38,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:38,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:39,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,073 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:39,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,240 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:39,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39 WrapperNode [2019-10-15 01:22:39,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:39,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:39,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:39,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:39,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:39,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:39,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:39,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:39,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:39,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:39,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:39,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:40,583 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:40,584 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:40,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:40 BoogieIcfgContainer [2019-10-15 01:22:40,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:40,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:40,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:40,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:40,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:38" (1/3) ... [2019-10-15 01:22:40,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2588042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:40, skipping insertion in model container [2019-10-15 01:22:40,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (2/3) ... [2019-10-15 01:22:40,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2588042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:40, skipping insertion in model container [2019-10-15 01:22:40,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:40" (3/3) ... [2019-10-15 01:22:40,594 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:40,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:40,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:40,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:40,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:40,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:40,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:40,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:40,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:40,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:40,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:40,655 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-15 01:22:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:22:40,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:40,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:40,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1231650886, now seen corresponding path program 1 times [2019-10-15 01:22:40,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:40,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253027384] [2019-10-15 01:22:40,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:41,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253027384] [2019-10-15 01:22:41,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:41,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:41,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523502566] [2019-10-15 01:22:41,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:41,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:41,432 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 4 states. [2019-10-15 01:22:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:41,668 INFO L93 Difference]: Finished difference Result 654 states and 1145 transitions. [2019-10-15 01:22:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:41,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-15 01:22:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:41,701 INFO L225 Difference]: With dead ends: 654 [2019-10-15 01:22:41,701 INFO L226 Difference]: Without dead ends: 430 [2019-10-15 01:22:41,710 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-15 01:22:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-15 01:22:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2019-10-15 01:22:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-15 01:22:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-15 01:22:41,835 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 99 [2019-10-15 01:22:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:41,837 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-15 01:22:41,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-15 01:22:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:22:41,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:41,850 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-15 01:22:41,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 829692944, now seen corresponding path program 1 times [2019-10-15 01:22:41,852 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:41,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694348294] [2019-10-15 01:22:41,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:41,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694348294] [2019-10-15 01:22:41,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:41,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:41,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137522771] [2019-10-15 01:22:41,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:41,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:41,962 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 3 states. [2019-10-15 01:22:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,021 INFO L93 Difference]: Finished difference Result 1238 states and 1811 transitions. [2019-10-15 01:22:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:42,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-15 01:22:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,027 INFO L225 Difference]: With dead ends: 1238 [2019-10-15 01:22:42,027 INFO L226 Difference]: Without dead ends: 842 [2019-10-15 01:22:42,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-15 01:22:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 430. [2019-10-15 01:22:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-10-15 01:22:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2019-10-15 01:22:42,105 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 100 [2019-10-15 01:22:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:42,107 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2019-10-15 01:22:42,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2019-10-15 01:22:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:22:42,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,119 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-15 01:22:42,119 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1677637145, now seen corresponding path program 1 times [2019-10-15 01:22:42,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682897771] [2019-10-15 01:22:42,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:42,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682897771] [2019-10-15 01:22:42,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:42,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:42,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734001682] [2019-10-15 01:22:42,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:42,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:42,346 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand 4 states. [2019-10-15 01:22:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,405 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2019-10-15 01:22:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:42,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-15 01:22:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,410 INFO L225 Difference]: With dead ends: 846 [2019-10-15 01:22:42,411 INFO L226 Difference]: Without dead ends: 428 [2019-10-15 01:22:42,413 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-15 01:22:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-10-15 01:22:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-10-15 01:22:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-15 01:22:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2019-10-15 01:22:42,438 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 101 [2019-10-15 01:22:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:42,438 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2019-10-15 01:22:42,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2019-10-15 01:22:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:22:42,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,444 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-15 01:22:42,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1471843135, now seen corresponding path program 1 times [2019-10-15 01:22:42,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5467366] [2019-10-15 01:22:42,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:42,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5467366] [2019-10-15 01:22:42,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:42,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:42,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127876065] [2019-10-15 01:22:42,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:42,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:42,566 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 3 states. [2019-10-15 01:22:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,634 INFO L93 Difference]: Finished difference Result 881 states and 1305 transitions. [2019-10-15 01:22:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:42,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:22:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,639 INFO L225 Difference]: With dead ends: 881 [2019-10-15 01:22:42,639 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:22:42,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:22:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-10-15 01:22:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-15 01:22:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2019-10-15 01:22:42,678 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 101 [2019-10-15 01:22:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:42,678 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2019-10-15 01:22:42,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2019-10-15 01:22:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:22:42,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,681 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-15 01:22:42,681 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1316339424, now seen corresponding path program 1 times [2019-10-15 01:22:42,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286560062] [2019-10-15 01:22:42,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:42,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286560062] [2019-10-15 01:22:42,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:42,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:22:42,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762097864] [2019-10-15 01:22:42,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:22:42,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:22:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:42,839 INFO L87 Difference]: Start difference. First operand 629 states and 910 transitions. Second operand 5 states. [2019-10-15 01:22:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,142 INFO L93 Difference]: Finished difference Result 1413 states and 2116 transitions. [2019-10-15 01:22:43,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:43,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:22:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,149 INFO L225 Difference]: With dead ends: 1413 [2019-10-15 01:22:43,149 INFO L226 Difference]: Without dead ends: 952 [2019-10-15 01:22:43,151 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-15 01:22:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-15 01:22:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-15 01:22:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-15 01:22:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1405 transitions. [2019-10-15 01:22:43,214 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1405 transitions. Word has length 103 [2019-10-15 01:22:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,215 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1405 transitions. [2019-10-15 01:22:43,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:22:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1405 transitions. [2019-10-15 01:22:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:22:43,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,218 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-15 01:22:43,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 822354405, now seen corresponding path program 1 times [2019-10-15 01:22:43,219 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566177252] [2019-10-15 01:22:43,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566177252] [2019-10-15 01:22:43,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008281624] [2019-10-15 01:22:43,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,452 INFO L87 Difference]: Start difference. First operand 950 states and 1405 transitions. Second operand 4 states. [2019-10-15 01:22:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,618 INFO L93 Difference]: Finished difference Result 2380 states and 3527 transitions. [2019-10-15 01:22:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:43,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-15 01:22:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,633 INFO L225 Difference]: With dead ends: 2380 [2019-10-15 01:22:43,634 INFO L226 Difference]: Without dead ends: 1453 [2019-10-15 01:22:43,637 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-15 01:22:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-15 01:22:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1451. [2019-10-15 01:22:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-15 01:22:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2130 transitions. [2019-10-15 01:22:43,744 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2130 transitions. Word has length 103 [2019-10-15 01:22:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,744 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2130 transitions. [2019-10-15 01:22:43,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2130 transitions. [2019-10-15 01:22:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:22:43,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,747 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-15 01:22:43,748 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1353908859, now seen corresponding path program 1 times [2019-10-15 01:22:43,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588426335] [2019-10-15 01:22:43,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588426335] [2019-10-15 01:22:43,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965511306] [2019-10-15 01:22:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,883 INFO L87 Difference]: Start difference. First operand 1451 states and 2130 transitions. Second operand 4 states. [2019-10-15 01:22:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,046 INFO L93 Difference]: Finished difference Result 2511 states and 3707 transitions. [2019-10-15 01:22:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:44,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:22:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,056 INFO L225 Difference]: With dead ends: 2511 [2019-10-15 01:22:44,056 INFO L226 Difference]: Without dead ends: 1451 [2019-10-15 01:22:44,059 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-15 01:22:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-15 01:22:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2019-10-15 01:22:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-15 01:22:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2129 transitions. [2019-10-15 01:22:44,267 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2129 transitions. Word has length 105 [2019-10-15 01:22:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2129 transitions. [2019-10-15 01:22:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2129 transitions. [2019-10-15 01:22:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:22:44,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,273 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-15 01:22:44,273 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash -673168968, now seen corresponding path program 1 times [2019-10-15 01:22:44,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333898886] [2019-10-15 01:22:44,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:44,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333898886] [2019-10-15 01:22:44,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:44,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38383832] [2019-10-15 01:22:44,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:44,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,428 INFO L87 Difference]: Start difference. First operand 1451 states and 2129 transitions. Second operand 3 states. [2019-10-15 01:22:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,670 INFO L93 Difference]: Finished difference Result 3308 states and 4930 transitions. [2019-10-15 01:22:44,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:44,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 01:22:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,682 INFO L225 Difference]: With dead ends: 3308 [2019-10-15 01:22:44,683 INFO L226 Difference]: Without dead ends: 2200 [2019-10-15 01:22:44,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-10-15 01:22:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2198. [2019-10-15 01:22:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-15 01:22:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3202 transitions. [2019-10-15 01:22:44,862 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3202 transitions. Word has length 105 [2019-10-15 01:22:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,864 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 3202 transitions. [2019-10-15 01:22:44,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3202 transitions. [2019-10-15 01:22:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:22:44,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,869 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-15 01:22:44,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash -312373315, now seen corresponding path program 1 times [2019-10-15 01:22:44,870 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454101973] [2019-10-15 01:22:44,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:45,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454101973] [2019-10-15 01:22:45,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:45,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835742650] [2019-10-15 01:22:45,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:45,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:45,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:45,094 INFO L87 Difference]: Start difference. First operand 2198 states and 3202 transitions. Second operand 4 states. [2019-10-15 01:22:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:45,430 INFO L93 Difference]: Finished difference Result 6352 states and 9243 transitions. [2019-10-15 01:22:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:45,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:22:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:45,451 INFO L225 Difference]: With dead ends: 6352 [2019-10-15 01:22:45,451 INFO L226 Difference]: Without dead ends: 4197 [2019-10-15 01:22:45,457 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-15 01:22:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-10-15 01:22:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4195. [2019-10-15 01:22:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-15 01:22:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6052 transitions. [2019-10-15 01:22:45,823 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6052 transitions. Word has length 107 [2019-10-15 01:22:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:45,824 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6052 transitions. [2019-10-15 01:22:45,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6052 transitions. [2019-10-15 01:22:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:22:45,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:45,830 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-15 01:22:45,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1907705071, now seen corresponding path program 1 times [2019-10-15 01:22:45,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:45,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364223771] [2019-10-15 01:22:45,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:45,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364223771] [2019-10-15 01:22:45,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:45,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100545504] [2019-10-15 01:22:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:45,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:45,886 INFO L87 Difference]: Start difference. First operand 4195 states and 6052 transitions. Second operand 3 states. [2019-10-15 01:22:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,575 INFO L93 Difference]: Finished difference Result 12393 states and 17909 transitions. [2019-10-15 01:22:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:46,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-15 01:22:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,728 INFO L225 Difference]: With dead ends: 12393 [2019-10-15 01:22:46,728 INFO L226 Difference]: Without dead ends: 8303 [2019-10-15 01:22:46,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-10-15 01:22:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 4201. [2019-10-15 01:22:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-10-15 01:22:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6058 transitions. [2019-10-15 01:22:47,224 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6058 transitions. Word has length 108 [2019-10-15 01:22:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:47,224 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 6058 transitions. [2019-10-15 01:22:47,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6058 transitions. [2019-10-15 01:22:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:22:47,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:47,230 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-15 01:22:47,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1358405212, now seen corresponding path program 1 times [2019-10-15 01:22:47,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:47,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728010562] [2019-10-15 01:22:47,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:47,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728010562] [2019-10-15 01:22:47,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:47,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:47,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082426189] [2019-10-15 01:22:47,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:47,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:47,349 INFO L87 Difference]: Start difference. First operand 4201 states and 6058 transitions. Second operand 4 states. [2019-10-15 01:22:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:47,750 INFO L93 Difference]: Finished difference Result 8360 states and 12060 transitions. [2019-10-15 01:22:47,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:47,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-15 01:22:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:47,797 INFO L225 Difference]: With dead ends: 8360 [2019-10-15 01:22:47,797 INFO L226 Difference]: Without dead ends: 4195 [2019-10-15 01:22:47,808 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-15 01:22:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-15 01:22:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-15 01:22:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-15 01:22:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6046 transitions. [2019-10-15 01:22:48,113 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6046 transitions. Word has length 109 [2019-10-15 01:22:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:48,114 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6046 transitions. [2019-10-15 01:22:48,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6046 transitions. [2019-10-15 01:22:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:22:48,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:48,120 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-15 01:22:48,120 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash 825640158, now seen corresponding path program 1 times [2019-10-15 01:22:48,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:48,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974339523] [2019-10-15 01:22:48,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:48,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:48,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:48,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974339523] [2019-10-15 01:22:48,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:48,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:48,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136026996] [2019-10-15 01:22:48,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:48,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:48,248 INFO L87 Difference]: Start difference. First operand 4195 states and 6046 transitions. Second operand 3 states. [2019-10-15 01:22:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:48,971 INFO L93 Difference]: Finished difference Result 9753 states and 14169 transitions. [2019-10-15 01:22:48,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:48,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 01:22:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:48,990 INFO L225 Difference]: With dead ends: 9753 [2019-10-15 01:22:48,990 INFO L226 Difference]: Without dead ends: 6233 [2019-10-15 01:22:48,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2019-10-15 01:22:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6231. [2019-10-15 01:22:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-10-15 01:22:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8841 transitions. [2019-10-15 01:22:49,442 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8841 transitions. Word has length 109 [2019-10-15 01:22:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 6231 states and 8841 transitions. [2019-10-15 01:22:49,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8841 transitions. [2019-10-15 01:22:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:22:49,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:49,451 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-15 01:22:49,451 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash 200750214, now seen corresponding path program 1 times [2019-10-15 01:22:49,452 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:49,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154713784] [2019-10-15 01:22:49,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:49,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154713784] [2019-10-15 01:22:49,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:49,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:22:49,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520109815] [2019-10-15 01:22:49,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:22:49,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:22:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:22:49,768 INFO L87 Difference]: Start difference. First operand 6231 states and 8841 transitions. Second operand 12 states. [2019-10-15 01:22:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,748 INFO L93 Difference]: Finished difference Result 17888 states and 26756 transitions. [2019-10-15 01:22:52,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:22:52,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-10-15 01:22:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,796 INFO L225 Difference]: With dead ends: 17888 [2019-10-15 01:22:52,797 INFO L226 Difference]: Without dead ends: 13847 [2019-10-15 01:22:52,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:22:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-10-15 01:22:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 12191. [2019-10-15 01:22:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2019-10-15 01:22:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 17824 transitions. [2019-10-15 01:22:54,085 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 17824 transitions. Word has length 111 [2019-10-15 01:22:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,086 INFO L462 AbstractCegarLoop]: Abstraction has 12191 states and 17824 transitions. [2019-10-15 01:22:54,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:22:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 17824 transitions. [2019-10-15 01:22:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:22:54,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,097 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-15 01:22:54,097 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash -825612106, now seen corresponding path program 1 times [2019-10-15 01:22:54,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467236472] [2019-10-15 01:22:54,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:54,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467236472] [2019-10-15 01:22:54,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:54,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:54,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461013196] [2019-10-15 01:22:54,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:54,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:54,224 INFO L87 Difference]: Start difference. First operand 12191 states and 17824 transitions. Second operand 3 states. [2019-10-15 01:22:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,019 INFO L93 Difference]: Finished difference Result 28778 states and 44113 transitions. [2019-10-15 01:22:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:56,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-15 01:22:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,084 INFO L225 Difference]: With dead ends: 28778 [2019-10-15 01:22:56,085 INFO L226 Difference]: Without dead ends: 20474 [2019-10-15 01:22:56,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-10-15 01:22:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20448. [2019-10-15 01:22:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20448 states. [2019-10-15 01:22:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20448 states to 20448 states and 30546 transitions. [2019-10-15 01:22:58,049 INFO L78 Accepts]: Start accepts. Automaton has 20448 states and 30546 transitions. Word has length 111 [2019-10-15 01:22:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,050 INFO L462 AbstractCegarLoop]: Abstraction has 20448 states and 30546 transitions. [2019-10-15 01:22:58,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 20448 states and 30546 transitions. [2019-10-15 01:22:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:22:58,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,061 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-15 01:22:58,062 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1946924417, now seen corresponding path program 1 times [2019-10-15 01:22:58,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599085577] [2019-10-15 01:22:58,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599085577] [2019-10-15 01:22:58,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:58,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426874183] [2019-10-15 01:22:58,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:58,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:58,289 INFO L87 Difference]: Start difference. First operand 20448 states and 30546 transitions. Second operand 8 states. [2019-10-15 01:22:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,898 INFO L93 Difference]: Finished difference Result 37536 states and 57114 transitions. [2019-10-15 01:22:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:59,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-10-15 01:22:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,947 INFO L225 Difference]: With dead ends: 37536 [2019-10-15 01:22:59,947 INFO L226 Difference]: Without dead ends: 20450 [2019-10-15 01:22:59,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20450 states. [2019-10-15 01:23:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20450 to 13342. [2019-10-15 01:23:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13342 states. [2019-10-15 01:23:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13342 states to 13342 states and 19521 transitions. [2019-10-15 01:23:00,850 INFO L78 Accepts]: Start accepts. Automaton has 13342 states and 19521 transitions. Word has length 111 [2019-10-15 01:23:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:00,850 INFO L462 AbstractCegarLoop]: Abstraction has 13342 states and 19521 transitions. [2019-10-15 01:23:00,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13342 states and 19521 transitions. [2019-10-15 01:23:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:23:00,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:00,860 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-15 01:23:00,860 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash 178287398, now seen corresponding path program 1 times [2019-10-15 01:23:00,861 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:00,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141583295] [2019-10-15 01:23:00,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:01,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141583295] [2019-10-15 01:23:01,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:01,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863292723] [2019-10-15 01:23:01,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:01,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:01,008 INFO L87 Difference]: Start difference. First operand 13342 states and 19521 transitions. Second operand 4 states. [2019-10-15 01:23:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,782 INFO L93 Difference]: Finished difference Result 25341 states and 37116 transitions. [2019-10-15 01:23:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:01,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:23:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,813 INFO L225 Difference]: With dead ends: 25341 [2019-10-15 01:23:01,814 INFO L226 Difference]: Without dead ends: 12319 [2019-10-15 01:23:01,840 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-15 01:23:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12319 states. [2019-10-15 01:23:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12319 to 12276. [2019-10-15 01:23:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12276 states. [2019-10-15 01:23:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12276 states to 12276 states and 17910 transitions. [2019-10-15 01:23:02,883 INFO L78 Accepts]: Start accepts. Automaton has 12276 states and 17910 transitions. Word has length 111 [2019-10-15 01:23:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,883 INFO L462 AbstractCegarLoop]: Abstraction has 12276 states and 17910 transitions. [2019-10-15 01:23:02,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12276 states and 17910 transitions. [2019-10-15 01:23:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:23:02,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,894 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-15 01:23:02,895 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 40427157, now seen corresponding path program 1 times [2019-10-15 01:23:02,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880391979] [2019-10-15 01:23:02,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:03,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880391979] [2019-10-15 01:23:03,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:03,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755074986] [2019-10-15 01:23:03,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:03,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:03,030 INFO L87 Difference]: Start difference. First operand 12276 states and 17910 transitions. Second operand 4 states. [2019-10-15 01:23:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:03,920 INFO L93 Difference]: Finished difference Result 24617 states and 35905 transitions. [2019-10-15 01:23:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:03,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:23:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:03,951 INFO L225 Difference]: With dead ends: 24617 [2019-10-15 01:23:03,952 INFO L226 Difference]: Without dead ends: 12494 [2019-10-15 01:23:03,972 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-15 01:23:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12494 states. [2019-10-15 01:23:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12494 to 12388. [2019-10-15 01:23:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-10-15 01:23:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 18026 transitions. [2019-10-15 01:23:05,296 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 18026 transitions. Word has length 113 [2019-10-15 01:23:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:05,296 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 18026 transitions. [2019-10-15 01:23:05,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 18026 transitions. [2019-10-15 01:23:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:05,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:05,303 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-15 01:23:05,303 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1035262953, now seen corresponding path program 1 times [2019-10-15 01:23:05,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:05,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629837843] [2019-10-15 01:23:05,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:05,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629837843] [2019-10-15 01:23:05,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:05,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:05,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574298018] [2019-10-15 01:23:05,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:05,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:05,350 INFO L87 Difference]: Start difference. First operand 12388 states and 18026 transitions. Second operand 3 states. [2019-10-15 01:23:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,922 INFO L93 Difference]: Finished difference Result 33523 states and 48997 transitions. [2019-10-15 01:23:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:06,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-15 01:23:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,948 INFO L225 Difference]: With dead ends: 33523 [2019-10-15 01:23:06,949 INFO L226 Difference]: Without dead ends: 24574 [2019-10-15 01:23:06,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24574 states. [2019-10-15 01:23:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24574 to 12398. [2019-10-15 01:23:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-10-15 01:23:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 18036 transitions. [2019-10-15 01:23:07,827 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 18036 transitions. Word has length 114 [2019-10-15 01:23:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:07,827 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 18036 transitions. [2019-10-15 01:23:07,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 18036 transitions. [2019-10-15 01:23:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:23:07,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:07,833 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-15 01:23:07,833 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1791064046, now seen corresponding path program 1 times [2019-10-15 01:23:07,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:07,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966892141] [2019-10-15 01:23:07,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:07,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966892141] [2019-10-15 01:23:07,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:07,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831139063] [2019-10-15 01:23:07,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:07,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:07,956 INFO L87 Difference]: Start difference. First operand 12398 states and 18036 transitions. Second operand 4 states. [2019-10-15 01:23:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:09,198 INFO L93 Difference]: Finished difference Result 24950 states and 36255 transitions. [2019-10-15 01:23:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:09,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-15 01:23:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:09,219 INFO L225 Difference]: With dead ends: 24950 [2019-10-15 01:23:09,220 INFO L226 Difference]: Without dead ends: 12854 [2019-10-15 01:23:09,230 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-15 01:23:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12854 states.