/usr/bin/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-fb55353 [2019-11-07 01:06:23,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:23,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:23,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:23,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:23,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:23,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:23,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:23,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:23,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:23,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:23,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:23,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:23,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:23,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:23,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:23,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:23,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:23,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:23,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:23,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:23,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:23,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:23,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:23,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:23,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:23,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:23,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:23,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:23,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:23,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:23,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:23,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:23,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:23,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:23,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:23,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:23,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:23,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:23,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:23,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:23,284 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-11-07 01:06:23,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:23,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:23,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:23,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:23,302 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:23,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:23,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:23,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:23,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:23,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:23,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:23,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:23,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:23,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:23,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:23,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:23,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:23,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:23,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:23,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:23,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:23,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:23,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:23,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:23,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:23,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:23,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:23,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:23,309 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-11-07 01:06:23,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:23,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:23,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:23,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:23,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:23,629 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-11-07 01:06:23,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec31f3fba/5dfc74bf5a0a4245a5ffc865dd8d9ba7/FLAG4a3127bfc [2019-11-07 01:06:24,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:24,225 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-11-07 01:06:24,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec31f3fba/5dfc74bf5a0a4245a5ffc865dd8d9ba7/FLAG4a3127bfc [2019-11-07 01:06:24,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec31f3fba/5dfc74bf5a0a4245a5ffc865dd8d9ba7 [2019-11-07 01:06:24,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:24,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:24,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:24,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:24,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:24,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100da794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24, skipping insertion in model container [2019-11-07 01:06:24,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,567 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:24,616 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:25,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:25,118 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:25,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:25,286 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:25,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25 WrapperNode [2019-11-07 01:06:25,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:25,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:25,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:25,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:25,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:25,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:25,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:25,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:25,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (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-11-07 01:06:25,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:25,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:25,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:06:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:26,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:26,925 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:26,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:26 BoogieIcfgContainer [2019-11-07 01:06:26,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:26,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:26,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:26,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:26,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:24" (1/3) ... [2019-11-07 01:06:26,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bac579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:26, skipping insertion in model container [2019-11-07 01:06:26,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (2/3) ... [2019-11-07 01:06:26,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bac579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:26, skipping insertion in model container [2019-11-07 01:06:26,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:26" (3/3) ... [2019-11-07 01:06:26,935 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:06:26,945 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:26,957 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:06:26,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:06:27,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:27,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:27,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:27,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:27,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:27,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:27,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:27,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2019-11-07 01:06:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:06:27,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:27,040 INFO L410 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-11-07 01:06:27,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1942738218, now seen corresponding path program 1 times [2019-11-07 01:06:27,056 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:27,056 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552746138] [2019-11-07 01:06:27,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:27,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552746138] [2019-11-07 01:06:27,657 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:27,657 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:27,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531249249] [2019-11-07 01:06:27,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:27,669 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:27,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:27,686 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 3 states. [2019-11-07 01:06:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,877 INFO L93 Difference]: Finished difference Result 509 states and 869 transitions. [2019-11-07 01:06:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:27,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-07 01:06:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,897 INFO L225 Difference]: With dead ends: 509 [2019-11-07 01:06:27,897 INFO L226 Difference]: Without dead ends: 375 [2019-11-07 01:06:27,902 INFO L630 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-11-07 01:06:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-07 01:06:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-11-07 01:06:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-07 01:06:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2019-11-07 01:06:28,016 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 105 [2019-11-07 01:06:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,018 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2019-11-07 01:06:28,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2019-11-07 01:06:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:06:28,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,028 INFO L410 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-11-07 01:06:28,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1562873963, now seen corresponding path program 1 times [2019-11-07 01:06:28,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299782886] [2019-11-07 01:06:28,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:28,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299782886] [2019-11-07 01:06:28,480 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,481 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:28,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526235307] [2019-11-07 01:06:28,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:28,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:28,484 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand 4 states. [2019-11-07 01:06:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,649 INFO L93 Difference]: Finished difference Result 1077 states and 1633 transitions. [2019-11-07 01:06:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:28,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-07 01:06:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,658 INFO L225 Difference]: With dead ends: 1077 [2019-11-07 01:06:28,658 INFO L226 Difference]: Without dead ends: 717 [2019-11-07 01:06:28,665 INFO L630 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-11-07 01:06:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-07 01:06:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2019-11-07 01:06:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-07 01:06:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1076 transitions. [2019-11-07 01:06:28,740 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1076 transitions. Word has length 105 [2019-11-07 01:06:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,743 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1076 transitions. [2019-11-07 01:06:28,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1076 transitions. [2019-11-07 01:06:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:06:28,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,754 INFO L410 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-11-07 01:06:28,754 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash 878256033, now seen corresponding path program 1 times [2019-11-07 01:06:28,756 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,756 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535246363] [2019-11-07 01:06:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:28,860 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535246363] [2019-11-07 01:06:28,860 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,860 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:28,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062239690] [2019-11-07 01:06:28,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:28,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:28,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:28,868 INFO L87 Difference]: Start difference. First operand 715 states and 1076 transitions. Second operand 3 states. [2019-11-07 01:06:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,947 INFO L93 Difference]: Finished difference Result 2099 states and 3158 transitions. [2019-11-07 01:06:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:28,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:06:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,958 INFO L225 Difference]: With dead ends: 2099 [2019-11-07 01:06:28,967 INFO L226 Difference]: Without dead ends: 1416 [2019-11-07 01:06:28,970 INFO L630 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-11-07 01:06:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-11-07 01:06:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 717. [2019-11-07 01:06:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-07 01:06:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1078 transitions. [2019-11-07 01:06:29,035 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1078 transitions. Word has length 106 [2019-11-07 01:06:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1078 transitions. [2019-11-07 01:06:29,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1078 transitions. [2019-11-07 01:06:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:06:29,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,038 INFO L410 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-11-07 01:06:29,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1289386322, now seen corresponding path program 1 times [2019-11-07 01:06:29,039 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,039 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669137192] [2019-11-07 01:06:29,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:29,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669137192] [2019-11-07 01:06:29,142 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,142 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:29,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203500424] [2019-11-07 01:06:29,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:29,144 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:29,145 INFO L87 Difference]: Start difference. First operand 717 states and 1078 transitions. Second operand 3 states. [2019-11-07 01:06:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,246 INFO L93 Difference]: Finished difference Result 1629 states and 2536 transitions. [2019-11-07 01:06:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:29,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-07 01:06:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,253 INFO L225 Difference]: With dead ends: 1629 [2019-11-07 01:06:29,253 INFO L226 Difference]: Without dead ends: 1043 [2019-11-07 01:06:29,255 INFO L630 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-11-07 01:06:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-07 01:06:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2019-11-07 01:06:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-11-07 01:06:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1569 transitions. [2019-11-07 01:06:29,361 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1569 transitions. Word has length 107 [2019-11-07 01:06:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,362 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1569 transitions. [2019-11-07 01:06:29,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1569 transitions. [2019-11-07 01:06:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:06:29,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,364 INFO L410 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-11-07 01:06:29,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash 75181962, now seen corresponding path program 1 times [2019-11-07 01:06:29,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144202182] [2019-11-07 01:06:29,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:29,500 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144202182] [2019-11-07 01:06:29,500 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,501 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:29,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815883513] [2019-11-07 01:06:29,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:29,502 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:29,502 INFO L87 Difference]: Start difference. First operand 1013 states and 1569 transitions. Second operand 4 states. [2019-11-07 01:06:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,588 INFO L93 Difference]: Finished difference Result 2008 states and 3113 transitions. [2019-11-07 01:06:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:29,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-07 01:06:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,594 INFO L225 Difference]: With dead ends: 2008 [2019-11-07 01:06:29,595 INFO L226 Difference]: Without dead ends: 1013 [2019-11-07 01:06:29,597 INFO L630 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-11-07 01:06:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-07 01:06:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2019-11-07 01:06:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-11-07 01:06:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1566 transitions. [2019-11-07 01:06:29,656 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1566 transitions. Word has length 107 [2019-11-07 01:06:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,656 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1566 transitions. [2019-11-07 01:06:29,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1566 transitions. [2019-11-07 01:06:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:06:29,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,659 INFO L410 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-11-07 01:06:29,659 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash -610700672, now seen corresponding path program 1 times [2019-11-07 01:06:29,660 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,660 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996000132] [2019-11-07 01:06:29,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:29,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996000132] [2019-11-07 01:06:29,762 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,762 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770098229] [2019-11-07 01:06:29,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:29,763 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:29,764 INFO L87 Difference]: Start difference. First operand 1012 states and 1566 transitions. Second operand 3 states. [2019-11-07 01:06:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,932 INFO L93 Difference]: Finished difference Result 2765 states and 4312 transitions. [2019-11-07 01:06:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:29,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-07 01:06:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,944 INFO L225 Difference]: With dead ends: 2765 [2019-11-07 01:06:29,944 INFO L226 Difference]: Without dead ends: 1949 [2019-11-07 01:06:29,946 INFO L630 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-11-07 01:06:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-11-07 01:06:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1947. [2019-11-07 01:06:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-11-07 01:06:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2988 transitions. [2019-11-07 01:06:30,067 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2988 transitions. Word has length 107 [2019-11-07 01:06:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,068 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 2988 transitions. [2019-11-07 01:06:30,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2988 transitions. [2019-11-07 01:06:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:06:30,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,075 INFO L410 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-11-07 01:06:30,075 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash 935860675, now seen corresponding path program 1 times [2019-11-07 01:06:30,077 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,077 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927869984] [2019-11-07 01:06:30,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:30,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927869984] [2019-11-07 01:06:30,248 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,248 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:30,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019504180] [2019-11-07 01:06:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:30,249 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:30,250 INFO L87 Difference]: Start difference. First operand 1947 states and 2988 transitions. Second operand 4 states. [2019-11-07 01:06:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,392 INFO L93 Difference]: Finished difference Result 3252 states and 5019 transitions. [2019-11-07 01:06:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:30,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-07 01:06:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,404 INFO L225 Difference]: With dead ends: 3252 [2019-11-07 01:06:30,404 INFO L226 Difference]: Without dead ends: 1489 [2019-11-07 01:06:30,413 INFO L630 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-11-07 01:06:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-11-07 01:06:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2019-11-07 01:06:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-11-07 01:06:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2274 transitions. [2019-11-07 01:06:30,544 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2274 transitions. Word has length 107 [2019-11-07 01:06:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,546 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 2274 transitions. [2019-11-07 01:06:30,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2274 transitions. [2019-11-07 01:06:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:06:30,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,550 INFO L410 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-11-07 01:06:30,551 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -967455086, now seen corresponding path program 1 times [2019-11-07 01:06:30,552 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,553 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089594426] [2019-11-07 01:06:30,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:30,689 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089594426] [2019-11-07 01:06:30,689 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,689 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:30,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059375065] [2019-11-07 01:06:30,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:30,691 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:30,692 INFO L87 Difference]: Start difference. First operand 1489 states and 2274 transitions. Second operand 3 states. [2019-11-07 01:06:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,951 INFO L93 Difference]: Finished difference Result 3562 states and 5609 transitions. [2019-11-07 01:06:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:30,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-07 01:06:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,963 INFO L225 Difference]: With dead ends: 3562 [2019-11-07 01:06:30,964 INFO L226 Difference]: Without dead ends: 2343 [2019-11-07 01:06:30,967 INFO L630 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-11-07 01:06:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-11-07 01:06:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2257. [2019-11-07 01:06:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-11-07 01:06:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3522 transitions. [2019-11-07 01:06:31,113 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3522 transitions. Word has length 109 [2019-11-07 01:06:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,114 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3522 transitions. [2019-11-07 01:06:31,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3522 transitions. [2019-11-07 01:06:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 01:06:31,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,116 INFO L410 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-11-07 01:06:31,117 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 195490705, now seen corresponding path program 1 times [2019-11-07 01:06:31,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058627322] [2019-11-07 01:06:31,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:31,314 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058627322] [2019-11-07 01:06:31,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,316 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:31,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431073802] [2019-11-07 01:06:31,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:31,317 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:31,318 INFO L87 Difference]: Start difference. First operand 2257 states and 3522 transitions. Second operand 4 states. [2019-11-07 01:06:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,590 INFO L93 Difference]: Finished difference Result 5820 states and 9101 transitions. [2019-11-07 01:06:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:31,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-07 01:06:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,608 INFO L225 Difference]: With dead ends: 5820 [2019-11-07 01:06:31,609 INFO L226 Difference]: Without dead ends: 3594 [2019-11-07 01:06:31,614 INFO L630 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-11-07 01:06:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-11-07 01:06:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2019-11-07 01:06:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-11-07 01:06:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5576 transitions. [2019-11-07 01:06:31,888 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5576 transitions. Word has length 110 [2019-11-07 01:06:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,888 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5576 transitions. [2019-11-07 01:06:31,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5576 transitions. [2019-11-07 01:06:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:06:31,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,891 INFO L410 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-11-07 01:06:31,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2099167218, now seen corresponding path program 1 times [2019-11-07 01:06:31,892 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,892 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101868056] [2019-11-07 01:06:31,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:31,993 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101868056] [2019-11-07 01:06:31,994 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,994 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:31,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573769441] [2019-11-07 01:06:31,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:31,995 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:31,996 INFO L87 Difference]: Start difference. First operand 3592 states and 5576 transitions. Second operand 3 states. [2019-11-07 01:06:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:32,349 INFO L93 Difference]: Finished difference Result 8748 states and 13683 transitions. [2019-11-07 01:06:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:32,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-07 01:06:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:32,378 INFO L225 Difference]: With dead ends: 8748 [2019-11-07 01:06:32,379 INFO L226 Difference]: Without dead ends: 5532 [2019-11-07 01:06:32,392 INFO L630 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-11-07 01:06:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-11-07 01:06:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5530. [2019-11-07 01:06:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2019-11-07 01:06:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 8515 transitions. [2019-11-07 01:06:32,895 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 8515 transitions. Word has length 112 [2019-11-07 01:06:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:32,896 INFO L462 AbstractCegarLoop]: Abstraction has 5530 states and 8515 transitions. [2019-11-07 01:06:32,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 8515 transitions. [2019-11-07 01:06:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:06:32,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:32,901 INFO L410 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-11-07 01:06:32,901 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash -122679506, now seen corresponding path program 1 times [2019-11-07 01:06:32,902 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:32,902 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160830751] [2019-11-07 01:06:32,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:33,015 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160830751] [2019-11-07 01:06:33,016 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:33,016 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:33,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559127010] [2019-11-07 01:06:33,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:33,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:33,019 INFO L87 Difference]: Start difference. First operand 5530 states and 8515 transitions. Second operand 3 states. [2019-11-07 01:06:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:33,657 INFO L93 Difference]: Finished difference Result 14570 states and 22850 transitions. [2019-11-07 01:06:33,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:33,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-07 01:06:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:33,728 INFO L225 Difference]: With dead ends: 14570 [2019-11-07 01:06:33,728 INFO L226 Difference]: Without dead ends: 9376 [2019-11-07 01:06:33,742 INFO L630 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-11-07 01:06:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-11-07 01:06:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 8966. [2019-11-07 01:06:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-11-07 01:06:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 14034 transitions. [2019-11-07 01:06:34,369 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 14034 transitions. Word has length 114 [2019-11-07 01:06:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:34,369 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 14034 transitions. [2019-11-07 01:06:34,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 14034 transitions. [2019-11-07 01:06:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-07 01:06:34,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:34,374 INFO L410 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-11-07 01:06:34,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1346619386, now seen corresponding path program 1 times [2019-11-07 01:06:34,375 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:34,375 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422064805] [2019-11-07 01:06:34,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:34,533 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422064805] [2019-11-07 01:06:34,533 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:34,533 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:34,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800521684] [2019-11-07 01:06:34,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:34,534 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:34,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:34,535 INFO L87 Difference]: Start difference. First operand 8966 states and 14034 transitions. Second operand 3 states. [2019-11-07 01:06:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:35,668 INFO L93 Difference]: Finished difference Result 25623 states and 40462 transitions. [2019-11-07 01:06:35,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:35,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-07 01:06:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:35,711 INFO L225 Difference]: With dead ends: 25623 [2019-11-07 01:06:35,711 INFO L226 Difference]: Without dead ends: 17325 [2019-11-07 01:06:35,729 INFO L630 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-11-07 01:06:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-11-07 01:06:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 17323. [2019-11-07 01:06:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-11-07 01:06:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 27148 transitions. [2019-11-07 01:06:37,388 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 27148 transitions. Word has length 115 [2019-11-07 01:06:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:37,388 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 27148 transitions. [2019-11-07 01:06:37,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 27148 transitions. [2019-11-07 01:06:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-07 01:06:37,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:37,394 INFO L410 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-11-07 01:06:37,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash 636430229, now seen corresponding path program 1 times [2019-11-07 01:06:37,395 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:37,395 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281023355] [2019-11-07 01:06:37,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:37,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281023355] [2019-11-07 01:06:37,571 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:37,572 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206731174] [2019-11-07 01:06:37,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:37,573 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:37,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:37,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:37,574 INFO L87 Difference]: Start difference. First operand 17323 states and 27148 transitions. Second operand 4 states. [2019-11-07 01:06:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:39,165 INFO L93 Difference]: Finished difference Result 48390 states and 75721 transitions. [2019-11-07 01:06:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:39,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-07 01:06:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:39,237 INFO L225 Difference]: With dead ends: 48390 [2019-11-07 01:06:39,237 INFO L226 Difference]: Without dead ends: 31110 [2019-11-07 01:06:39,276 INFO L630 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-11-07 01:06:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2019-11-07 01:06:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 31108. [2019-11-07 01:06:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31108 states. [2019-11-07 01:06:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31108 states to 31108 states and 48219 transitions. [2019-11-07 01:06:41,028 INFO L78 Accepts]: Start accepts. Automaton has 31108 states and 48219 transitions. Word has length 115 [2019-11-07 01:06:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:41,028 INFO L462 AbstractCegarLoop]: Abstraction has 31108 states and 48219 transitions. [2019-11-07 01:06:41,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31108 states and 48219 transitions. [2019-11-07 01:06:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-07 01:06:41,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:41,036 INFO L410 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-11-07 01:06:41,036 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2111377993, now seen corresponding path program 1 times [2019-11-07 01:06:41,037 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:41,037 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769394986] [2019-11-07 01:06:41,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:41,093 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769394986] [2019-11-07 01:06:41,093 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:41,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:41,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236903777] [2019-11-07 01:06:41,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:41,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:41,095 INFO L87 Difference]: Start difference. First operand 31108 states and 48219 transitions. Second operand 3 states. [2019-11-07 01:06:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,029 INFO L93 Difference]: Finished difference Result 93118 states and 144394 transitions. [2019-11-07 01:06:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-07 01:06:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,189 INFO L225 Difference]: With dead ends: 93118 [2019-11-07 01:06:44,189 INFO L226 Difference]: Without dead ends: 62122 [2019-11-07 01:06:44,250 INFO L630 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-11-07 01:06:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62122 states. [2019-11-07 01:06:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62122 to 31114. [2019-11-07 01:06:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31114 states. [2019-11-07 01:06:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31114 states to 31114 states and 48225 transitions. [2019-11-07 01:06:45,924 INFO L78 Accepts]: Start accepts. Automaton has 31114 states and 48225 transitions. Word has length 116 [2019-11-07 01:06:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:45,924 INFO L462 AbstractCegarLoop]: Abstraction has 31114 states and 48225 transitions. [2019-11-07 01:06:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31114 states and 48225 transitions. [2019-11-07 01:06:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 01:06:45,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:45,931 INFO L410 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-11-07 01:06:45,931 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851444, now seen corresponding path program 1 times [2019-11-07 01:06:45,932 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:45,932 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608443573] [2019-11-07 01:06:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:46,058 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608443573] [2019-11-07 01:06:46,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:46,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:46,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975726138] [2019-11-07 01:06:46,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:46,059 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:46,060 INFO L87 Difference]: Start difference. First operand 31114 states and 48225 transitions. Second operand 4 states. [2019-11-07 01:06:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:47,297 INFO L93 Difference]: Finished difference Result 62114 states and 96305 transitions. [2019-11-07 01:06:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:47,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-07 01:06:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:47,335 INFO L225 Difference]: With dead ends: 62114 [2019-11-07 01:06:47,335 INFO L226 Difference]: Without dead ends: 31114 [2019-11-07 01:06:47,374 INFO L630 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-11-07 01:06:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31114 states. [2019-11-07 01:06:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31114 to 31111. [2019-11-07 01:06:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31111 states. [2019-11-07 01:06:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31111 states to 31111 states and 48218 transitions. [2019-11-07 01:06:49,666 INFO L78 Accepts]: Start accepts. Automaton has 31111 states and 48218 transitions. Word has length 117 [2019-11-07 01:06:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:49,667 INFO L462 AbstractCegarLoop]: Abstraction has 31111 states and 48218 transitions. [2019-11-07 01:06:49,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31111 states and 48218 transitions. [2019-11-07 01:06:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 01:06:49,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,673 INFO L410 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-11-07 01:06:49,674 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 32262, now seen corresponding path program 1 times [2019-11-07 01:06:49,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,675 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439040074] [2019-11-07 01:06:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:49,755 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439040074] [2019-11-07 01:06:49,755 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:49,755 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:49,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273555216] [2019-11-07 01:06:49,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:49,756 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:49,757 INFO L87 Difference]: Start difference. First operand 31111 states and 48218 transitions. Second operand 3 states. [2019-11-07 01:06:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,832 INFO L93 Difference]: Finished difference Result 80969 states and 125370 transitions. [2019-11-07 01:06:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:51,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-07 01:06:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,901 INFO L225 Difference]: With dead ends: 80969 [2019-11-07 01:06:51,901 INFO L226 Difference]: Without dead ends: 50895 [2019-11-07 01:06:51,930 INFO L630 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-11-07 01:06:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50895 states. [2019-11-07 01:06:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50895 to 50893. [2019-11-07 01:06:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50893 states. [2019-11-07 01:06:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50893 states to 50893 states and 77668 transitions. [2019-11-07 01:06:54,180 INFO L78 Accepts]: Start accepts. Automaton has 50893 states and 77668 transitions. Word has length 117 [2019-11-07 01:06:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:54,181 INFO L462 AbstractCegarLoop]: Abstraction has 50893 states and 77668 transitions. [2019-11-07 01:06:54,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 50893 states and 77668 transitions. [2019-11-07 01:06:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 01:06:54,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:54,189 INFO L410 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-11-07 01:06:54,190 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash 177694473, now seen corresponding path program 1 times [2019-11-07 01:06:54,190 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:54,190 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763566004] [2019-11-07 01:06:54,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:54,300 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763566004] [2019-11-07 01:06:54,300 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:54,300 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:54,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065697437] [2019-11-07 01:06:54,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:54,301 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:54,302 INFO L87 Difference]: Start difference. First operand 50893 states and 77668 transitions. Second operand 4 states. [2019-11-07 01:06:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:56,969 INFO L93 Difference]: Finished difference Result 94925 states and 145243 transitions. [2019-11-07 01:06:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:56,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-07 01:06:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:57,053 INFO L225 Difference]: With dead ends: 94925 [2019-11-07 01:06:57,053 INFO L226 Difference]: Without dead ends: 44923 [2019-11-07 01:06:57,109 INFO L630 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-11-07 01:06:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44923 states.