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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:43,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:43,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:43,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:43,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:43,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:43,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:43,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:43,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:43,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:43,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:43,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:43,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:43,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:43,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:43,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:43,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:43,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:43,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:43,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:43,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:43,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:43,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:43,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:43,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:43,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:43,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:43,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:43,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:43,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:43,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:43,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:43,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:43,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:43,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:43,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:43,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:43,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:43,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:43,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:43,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:43,135 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:23:43,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:43,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:43,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:43,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:43,157 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:43,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:43,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:43,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:43,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:43,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:43,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:43,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:43,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:43,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:43,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:43,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:43,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:43,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:43,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:43,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:43,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:43,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:43,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:43,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:43,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:43,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:43,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:43,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:43,163 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:23:43,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:43,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:43,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:43,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:43,444 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:43,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:43,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de0c4e3/2b3b10639102460c87de5881971a5352/FLAG8f3f0b3d1 [2019-10-15 01:23:44,018 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:44,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:44,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de0c4e3/2b3b10639102460c87de5881971a5352/FLAG8f3f0b3d1 [2019-10-15 01:23:44,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de0c4e3/2b3b10639102460c87de5881971a5352 [2019-10-15 01:23:44,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:44,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:44,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:44,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:44,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:44,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:44" (1/1) ... [2019-10-15 01:23:44,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295c9e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:44, skipping insertion in model container [2019-10-15 01:23:44,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:44" (1/1) ... [2019-10-15 01:23:44,366 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:44,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:44,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:44,890 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:45,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:45,043 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:45,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45 WrapperNode [2019-10-15 01:23:45,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:45,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:45,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:45,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:45,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:45,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:45,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:45,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:45,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (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:23:45,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:45,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:45,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:45,228 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:45,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:46,328 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:46,329 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:46 BoogieIcfgContainer [2019-10-15 01:23:46,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:46,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:46,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:46,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:46,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:44" (1/3) ... [2019-10-15 01:23:46,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65633ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:46, skipping insertion in model container [2019-10-15 01:23:46,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45" (2/3) ... [2019-10-15 01:23:46,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65633ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:46, skipping insertion in model container [2019-10-15 01:23:46,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:46" (3/3) ... [2019-10-15 01:23:46,343 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:46,350 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:46,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:46,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:46,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:46,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:46,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:46,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:46,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:46,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:46,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:46,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2019-10-15 01:23:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:23:46,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,445 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:23:46,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1942738218, now seen corresponding path program 1 times [2019-10-15 01:23:46,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293601282] [2019-10-15 01:23:46,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,016 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:47,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293601282] [2019-10-15 01:23:47,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:47,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:47,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103875173] [2019-10-15 01:23:47,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:47,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:47,042 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 3 states. [2019-10-15 01:23:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,205 INFO L93 Difference]: Finished difference Result 509 states and 869 transitions. [2019-10-15 01:23:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:47,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 01:23:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,224 INFO L225 Difference]: With dead ends: 509 [2019-10-15 01:23:47,224 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:23:47,229 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:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:23:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-10-15 01:23:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-15 01:23:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2019-10-15 01:23:47,311 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 105 [2019-10-15 01:23:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,312 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2019-10-15 01:23:47,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2019-10-15 01:23:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:23:47,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,316 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:23:47,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1562873963, now seen corresponding path program 1 times [2019-10-15 01:23:47,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792268335] [2019-10-15 01:23:47,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,701 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:47,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792268335] [2019-10-15 01:23:47,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:47,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:47,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856301943] [2019-10-15 01:23:47,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:47,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:47,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:47,707 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand 4 states. [2019-10-15 01:23:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,864 INFO L93 Difference]: Finished difference Result 1077 states and 1633 transitions. [2019-10-15 01:23:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:47,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:23:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,871 INFO L225 Difference]: With dead ends: 1077 [2019-10-15 01:23:47,871 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:23:47,877 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:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:23:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2019-10-15 01:23:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-15 01:23:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1076 transitions. [2019-10-15 01:23:47,958 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1076 transitions. Word has length 105 [2019-10-15 01:23:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,961 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1076 transitions. [2019-10-15 01:23:47,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1076 transitions. [2019-10-15 01:23:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:23:47,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,974 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] [2019-10-15 01:23:47,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash 878256033, now seen corresponding path program 1 times [2019-10-15 01:23:47,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486590647] [2019-10-15 01:23:47,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,054 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:48,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486590647] [2019-10-15 01:23:48,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:48,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035500505] [2019-10-15 01:23:48,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:48,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:48,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:48,062 INFO L87 Difference]: Start difference. First operand 715 states and 1076 transitions. Second operand 3 states. [2019-10-15 01:23:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:48,140 INFO L93 Difference]: Finished difference Result 2099 states and 3158 transitions. [2019-10-15 01:23:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:48,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:23:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:48,148 INFO L225 Difference]: With dead ends: 2099 [2019-10-15 01:23:48,149 INFO L226 Difference]: Without dead ends: 1416 [2019-10-15 01:23:48,151 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:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-15 01:23:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 717. [2019-10-15 01:23:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:23:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1078 transitions. [2019-10-15 01:23:48,194 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1078 transitions. Word has length 106 [2019-10-15 01:23:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,194 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1078 transitions. [2019-10-15 01:23:48,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1078 transitions. [2019-10-15 01:23:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:23:48,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,197 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:23:48,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1289386322, now seen corresponding path program 1 times [2019-10-15 01:23:48,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901564047] [2019-10-15 01:23:48,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:48,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901564047] [2019-10-15 01:23:48,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:48,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346790060] [2019-10-15 01:23:48,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:48,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:48,295 INFO L87 Difference]: Start difference. First operand 717 states and 1078 transitions. Second operand 3 states. [2019-10-15 01:23:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:48,398 INFO L93 Difference]: Finished difference Result 1629 states and 2536 transitions. [2019-10-15 01:23:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:48,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 01:23:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:48,407 INFO L225 Difference]: With dead ends: 1629 [2019-10-15 01:23:48,407 INFO L226 Difference]: Without dead ends: 1043 [2019-10-15 01:23:48,409 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:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-15 01:23:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2019-10-15 01:23:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-10-15 01:23:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1569 transitions. [2019-10-15 01:23:48,487 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1569 transitions. Word has length 107 [2019-10-15 01:23:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,489 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1569 transitions. [2019-10-15 01:23:48,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1569 transitions. [2019-10-15 01:23:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:23:48,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,493 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:23:48,493 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash 75181962, now seen corresponding path program 1 times [2019-10-15 01:23:48,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753696494] [2019-10-15 01:23:48,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,768 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:48,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753696494] [2019-10-15 01:23:48,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:48,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970173598] [2019-10-15 01:23:48,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:48,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:48,773 INFO L87 Difference]: Start difference. First operand 1013 states and 1569 transitions. Second operand 4 states. [2019-10-15 01:23:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:48,904 INFO L93 Difference]: Finished difference Result 2008 states and 3113 transitions. [2019-10-15 01:23:48,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:48,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:23:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:48,914 INFO L225 Difference]: With dead ends: 2008 [2019-10-15 01:23:48,914 INFO L226 Difference]: Without dead ends: 1013 [2019-10-15 01:23:48,917 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:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-10-15 01:23:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2019-10-15 01:23:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-15 01:23:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1566 transitions. [2019-10-15 01:23:48,989 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1566 transitions. Word has length 107 [2019-10-15 01:23:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,989 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1566 transitions. [2019-10-15 01:23:48,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1566 transitions. [2019-10-15 01:23:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:23:48,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,991 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:23:48,992 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -610700672, now seen corresponding path program 1 times [2019-10-15 01:23:48,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943430107] [2019-10-15 01:23:48,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:49,160 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:49,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943430107] [2019-10-15 01:23:49,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:49,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:49,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337107394] [2019-10-15 01:23:49,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:49,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:49,163 INFO L87 Difference]: Start difference. First operand 1012 states and 1566 transitions. Second operand 3 states. [2019-10-15 01:23:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:49,298 INFO L93 Difference]: Finished difference Result 2765 states and 4312 transitions. [2019-10-15 01:23:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:49,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 01:23:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:49,311 INFO L225 Difference]: With dead ends: 2765 [2019-10-15 01:23:49,311 INFO L226 Difference]: Without dead ends: 1949 [2019-10-15 01:23:49,314 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:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-10-15 01:23:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1947. [2019-10-15 01:23:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-15 01:23:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2988 transitions. [2019-10-15 01:23:49,452 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2988 transitions. Word has length 107 [2019-10-15 01:23:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:49,452 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 2988 transitions. [2019-10-15 01:23:49,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2988 transitions. [2019-10-15 01:23:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:23:49,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 935860675, now seen corresponding path program 1 times [2019-10-15 01:23:49,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014742301] [2019-10-15 01:23:49,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:49,600 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:49,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014742301] [2019-10-15 01:23:49,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:49,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:49,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629511577] [2019-10-15 01:23:49,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:49,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:49,603 INFO L87 Difference]: Start difference. First operand 1947 states and 2988 transitions. Second operand 4 states. [2019-10-15 01:23:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:49,719 INFO L93 Difference]: Finished difference Result 3252 states and 5019 transitions. [2019-10-15 01:23:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:49,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:23:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:49,728 INFO L225 Difference]: With dead ends: 3252 [2019-10-15 01:23:49,728 INFO L226 Difference]: Without dead ends: 1489 [2019-10-15 01:23:49,732 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:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-10-15 01:23:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2019-10-15 01:23:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-10-15 01:23:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2274 transitions. [2019-10-15 01:23:49,869 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2274 transitions. Word has length 107 [2019-10-15 01:23:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:49,869 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 2274 transitions. [2019-10-15 01:23:49,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2274 transitions. [2019-10-15 01:23:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:23:49,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,873 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:23:49,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash -967455086, now seen corresponding path program 1 times [2019-10-15 01:23:49,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270577126] [2019-10-15 01:23:49,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:49,950 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:49,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270577126] [2019-10-15 01:23:49,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:49,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:49,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135742134] [2019-10-15 01:23:49,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:49,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:49,952 INFO L87 Difference]: Start difference. First operand 1489 states and 2274 transitions. Second operand 3 states. [2019-10-15 01:23:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,111 INFO L93 Difference]: Finished difference Result 3562 states and 5609 transitions. [2019-10-15 01:23:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:50,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 01:23:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,125 INFO L225 Difference]: With dead ends: 3562 [2019-10-15 01:23:50,125 INFO L226 Difference]: Without dead ends: 2343 [2019-10-15 01:23:50,129 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:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-10-15 01:23:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2257. [2019-10-15 01:23:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-10-15 01:23:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3522 transitions. [2019-10-15 01:23:50,272 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3522 transitions. Word has length 109 [2019-10-15 01:23:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:50,273 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3522 transitions. [2019-10-15 01:23:50,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3522 transitions. [2019-10-15 01:23:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:23:50,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:50,275 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] [2019-10-15 01:23:50,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 195490705, now seen corresponding path program 1 times [2019-10-15 01:23:50,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:50,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799684367] [2019-10-15 01:23:50,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:50,480 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:50,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799684367] [2019-10-15 01:23:50,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:50,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:50,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189101128] [2019-10-15 01:23:50,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:50,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:50,484 INFO L87 Difference]: Start difference. First operand 2257 states and 3522 transitions. Second operand 4 states. [2019-10-15 01:23:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,753 INFO L93 Difference]: Finished difference Result 5820 states and 9101 transitions. [2019-10-15 01:23:50,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:50,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:23:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,770 INFO L225 Difference]: With dead ends: 5820 [2019-10-15 01:23:50,770 INFO L226 Difference]: Without dead ends: 3594 [2019-10-15 01:23:50,777 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:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-15 01:23:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2019-10-15 01:23:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-15 01:23:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5576 transitions. [2019-10-15 01:23:51,019 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5576 transitions. Word has length 110 [2019-10-15 01:23:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,020 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5576 transitions. [2019-10-15 01:23:51,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5576 transitions. [2019-10-15 01:23:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:23:51,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,024 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] [2019-10-15 01:23:51,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2099167218, now seen corresponding path program 1 times [2019-10-15 01:23:51,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370732900] [2019-10-15 01:23:51,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,168 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:51,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370732900] [2019-10-15 01:23:51,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:51,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645015637] [2019-10-15 01:23:51,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:51,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:51,170 INFO L87 Difference]: Start difference. First operand 3592 states and 5576 transitions. Second operand 3 states. [2019-10-15 01:23:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,518 INFO L93 Difference]: Finished difference Result 8748 states and 13683 transitions. [2019-10-15 01:23:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:51,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-15 01:23:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,550 INFO L225 Difference]: With dead ends: 8748 [2019-10-15 01:23:51,550 INFO L226 Difference]: Without dead ends: 5532 [2019-10-15 01:23:51,567 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:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-10-15 01:23:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5530. [2019-10-15 01:23:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2019-10-15 01:23:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 8515 transitions. [2019-10-15 01:23:52,032 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 8515 transitions. Word has length 112 [2019-10-15 01:23:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,032 INFO L462 AbstractCegarLoop]: Abstraction has 5530 states and 8515 transitions. [2019-10-15 01:23:52,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 8515 transitions. [2019-10-15 01:23:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:52,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,036 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:52,036 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash -122679506, now seen corresponding path program 1 times [2019-10-15 01:23:52,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656135783] [2019-10-15 01:23:52,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,127 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:52,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656135783] [2019-10-15 01:23:52,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437546449] [2019-10-15 01:23:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,130 INFO L87 Difference]: Start difference. First operand 5530 states and 8515 transitions. Second operand 3 states. [2019-10-15 01:23:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,843 INFO L93 Difference]: Finished difference Result 14570 states and 22850 transitions. [2019-10-15 01:23:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:52,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-15 01:23:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,918 INFO L225 Difference]: With dead ends: 14570 [2019-10-15 01:23:52,918 INFO L226 Difference]: Without dead ends: 9376 [2019-10-15 01:23:52,934 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:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-10-15 01:23:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 8966. [2019-10-15 01:23:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-10-15 01:23:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 14034 transitions. [2019-10-15 01:23:53,547 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 14034 transitions. Word has length 114 [2019-10-15 01:23:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,547 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 14034 transitions. [2019-10-15 01:23:53,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 14034 transitions. [2019-10-15 01:23:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:23:53,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,551 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,552 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1346619386, now seen corresponding path program 1 times [2019-10-15 01:23:53,552 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60520267] [2019-10-15 01:23:53,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,624 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:53,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60520267] [2019-10-15 01:23:53,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146869875] [2019-10-15 01:23:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,626 INFO L87 Difference]: Start difference. First operand 8966 states and 14034 transitions. Second operand 3 states. [2019-10-15 01:23:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,761 INFO L93 Difference]: Finished difference Result 25623 states and 40462 transitions. [2019-10-15 01:23:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:54,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-15 01:23:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,800 INFO L225 Difference]: With dead ends: 25623 [2019-10-15 01:23:54,800 INFO L226 Difference]: Without dead ends: 17325 [2019-10-15 01:23:54,817 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:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-10-15 01:23:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 17323. [2019-10-15 01:23:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-10-15 01:23:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 27148 transitions. [2019-10-15 01:23:55,929 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 27148 transitions. Word has length 115 [2019-10-15 01:23:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,930 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 27148 transitions. [2019-10-15 01:23:55,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 27148 transitions. [2019-10-15 01:23:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:23:55,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,935 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 636430229, now seen corresponding path program 1 times [2019-10-15 01:23:55,936 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080180424] [2019-10-15 01:23:55,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:56,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080180424] [2019-10-15 01:23:56,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:56,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069857596] [2019-10-15 01:23:56,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:56,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:56,087 INFO L87 Difference]: Start difference. First operand 17323 states and 27148 transitions. Second operand 4 states. [2019-10-15 01:23:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,088 INFO L93 Difference]: Finished difference Result 48390 states and 75721 transitions. [2019-10-15 01:23:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:58,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-15 01:23:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,167 INFO L225 Difference]: With dead ends: 48390 [2019-10-15 01:23:58,167 INFO L226 Difference]: Without dead ends: 31110 [2019-10-15 01:23:58,200 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:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2019-10-15 01:23:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 31108. [2019-10-15 01:23:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31108 states. [2019-10-15 01:23:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31108 states to 31108 states and 48219 transitions. [2019-10-15 01:23:59,882 INFO L78 Accepts]: Start accepts. Automaton has 31108 states and 48219 transitions. Word has length 115 [2019-10-15 01:23:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:59,883 INFO L462 AbstractCegarLoop]: Abstraction has 31108 states and 48219 transitions. [2019-10-15 01:23:59,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 31108 states and 48219 transitions. [2019-10-15 01:23:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:23:59,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:59,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:59,892 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2111377993, now seen corresponding path program 1 times [2019-10-15 01:23:59,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:59,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501779506] [2019-10-15 01:23:59,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,945 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:59,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501779506] [2019-10-15 01:23:59,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:59,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:59,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675495038] [2019-10-15 01:23:59,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:59,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:59,947 INFO L87 Difference]: Start difference. First operand 31108 states and 48219 transitions. Second operand 3 states. [2019-10-15 01:24:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:02,846 INFO L93 Difference]: Finished difference Result 93118 states and 144394 transitions. [2019-10-15 01:24:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:02,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-15 01:24:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:02,988 INFO L225 Difference]: With dead ends: 93118 [2019-10-15 01:24:02,989 INFO L226 Difference]: Without dead ends: 62122 [2019-10-15 01:24:03,046 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:24:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62122 states. [2019-10-15 01:24:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62122 to 31114. [2019-10-15 01:24:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31114 states. [2019-10-15 01:24:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31114 states to 31114 states and 48225 transitions. [2019-10-15 01:24:05,016 INFO L78 Accepts]: Start accepts. Automaton has 31114 states and 48225 transitions. Word has length 116 [2019-10-15 01:24:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,016 INFO L462 AbstractCegarLoop]: Abstraction has 31114 states and 48225 transitions. [2019-10-15 01:24:05,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31114 states and 48225 transitions. [2019-10-15 01:24:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:24:05,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,023 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851444, now seen corresponding path program 1 times [2019-10-15 01:24:05,024 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748785341] [2019-10-15 01:24:05,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,135 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:24:05,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748785341] [2019-10-15 01:24:05,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:05,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168300736] [2019-10-15 01:24:05,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:05,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:05,137 INFO L87 Difference]: Start difference. First operand 31114 states and 48225 transitions. Second operand 4 states. [2019-10-15 01:24:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,161 INFO L93 Difference]: Finished difference Result 62114 states and 96305 transitions. [2019-10-15 01:24:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-15 01:24:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,414 INFO L225 Difference]: With dead ends: 62114 [2019-10-15 01:24:06,415 INFO L226 Difference]: Without dead ends: 31114 [2019-10-15 01:24:06,446 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:24:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31114 states. [2019-10-15 01:24:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31114 to 31111. [2019-10-15 01:24:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31111 states. [2019-10-15 01:24:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31111 states to 31111 states and 48218 transitions. [2019-10-15 01:24:07,605 INFO L78 Accepts]: Start accepts. Automaton has 31111 states and 48218 transitions. Word has length 117 [2019-10-15 01:24:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:07,605 INFO L462 AbstractCegarLoop]: Abstraction has 31111 states and 48218 transitions. [2019-10-15 01:24:07,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31111 states and 48218 transitions. [2019-10-15 01:24:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:24:07,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:07,613 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,613 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 32262, now seen corresponding path program 1 times [2019-10-15 01:24:07,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:07,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368262881] [2019-10-15 01:24:07,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,712 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:24:07,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368262881] [2019-10-15 01:24:07,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:07,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848570269] [2019-10-15 01:24:07,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:07,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:07,715 INFO L87 Difference]: Start difference. First operand 31111 states and 48218 transitions. Second operand 3 states. [2019-10-15 01:24:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,364 INFO L93 Difference]: Finished difference Result 80969 states and 125370 transitions. [2019-10-15 01:24:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:10,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-15 01:24:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,421 INFO L225 Difference]: With dead ends: 80969 [2019-10-15 01:24:10,421 INFO L226 Difference]: Without dead ends: 50895 [2019-10-15 01:24:10,449 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:24:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50895 states. [2019-10-15 01:24:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50895 to 50893. [2019-10-15 01:24:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50893 states. [2019-10-15 01:24:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50893 states to 50893 states and 77668 transitions. [2019-10-15 01:24:12,579 INFO L78 Accepts]: Start accepts. Automaton has 50893 states and 77668 transitions. Word has length 117 [2019-10-15 01:24:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:12,579 INFO L462 AbstractCegarLoop]: Abstraction has 50893 states and 77668 transitions. [2019-10-15 01:24:12,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50893 states and 77668 transitions. [2019-10-15 01:24:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:24:12,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:12,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:12,589 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash 177694473, now seen corresponding path program 1 times [2019-10-15 01:24:12,590 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:12,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039011965] [2019-10-15 01:24:12,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:12,692 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:24:12,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039011965] [2019-10-15 01:24:12,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:12,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:12,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102972575] [2019-10-15 01:24:12,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:12,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:12,694 INFO L87 Difference]: Start difference. First operand 50893 states and 77668 transitions. Second operand 4 states. [2019-10-15 01:24:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,647 INFO L93 Difference]: Finished difference Result 94925 states and 145243 transitions. [2019-10-15 01:24:14,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:14,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-15 01:24:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,699 INFO L225 Difference]: With dead ends: 94925 [2019-10-15 01:24:14,699 INFO L226 Difference]: Without dead ends: 44923 [2019-10-15 01:24:14,729 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:24:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44923 states. [2019-10-15 01:24:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44923 to 44923. [2019-10-15 01:24:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44923 states.