/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.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:21,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:21,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:22,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:22,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:22,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:22,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:22,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:22,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:22,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:22,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:22,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:22,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:22,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:22,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:22,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:22,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:22,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:22,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:22,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:22,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:22,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:22,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:22,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:22,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:22,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:22,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:22,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:22,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:22,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:22,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:22,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:22,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:22,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:22,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:22,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:22,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:22,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:22,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:22,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:22,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:22,050 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:22,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:22,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:22,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:22,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:22,080 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:22,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:22,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:22,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:22,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:22,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:22,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:22,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:22,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:22,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:22,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:22,082 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:22,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:22,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:22,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:22,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:22,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:22,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:22,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:22,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:22,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:22,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:22,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:22,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:22,085 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:22,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:22,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:22,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:22,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:22,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:22,406 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.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:22,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb404e8a/be5429e23e3440a3bbd5d21675fd67b2/FLAGb6a0138f2 [2019-11-07 01:06:23,026 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:23,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:23,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb404e8a/be5429e23e3440a3bbd5d21675fd67b2/FLAGb6a0138f2 [2019-11-07 01:06:23,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb404e8a/be5429e23e3440a3bbd5d21675fd67b2 [2019-11-07 01:06:23,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:23,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:23,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:23,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:23,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:23,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:23" (1/1) ... [2019-11-07 01:06:23,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edede8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:23, skipping insertion in model container [2019-11-07 01:06:23,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:23" (1/1) ... [2019-11-07 01:06:23,337 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:23,397 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:23,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:23,859 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:24,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:24,035 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:24,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24 WrapperNode [2019-11-07 01:06:24,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:24,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:24,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:24,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:24,049 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:24" (1/1) ... [2019-11-07 01:06:24,049 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:24" (1/1) ... [2019-11-07 01:06:24,062 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:24" (1/1) ... [2019-11-07 01:06:24,063 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:24" (1/1) ... [2019-11-07 01:06:24,082 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:24" (1/1) ... [2019-11-07 01:06:24,098 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:24" (1/1) ... [2019-11-07 01:06:24,102 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:24" (1/1) ... [2019-11-07 01:06:24,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:24,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:24,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:24,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:24,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24" (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:24,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:24,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:24,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:24,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:24,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:24,216 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:24,217 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:24,217 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:24,217 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:24,217 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:24,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:25,423 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:25,423 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:25,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:25 BoogieIcfgContainer [2019-11-07 01:06:25,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:25,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:25,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:25,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:25,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:23" (1/3) ... [2019-11-07 01:06:25,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b9fe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:25, skipping insertion in model container [2019-11-07 01:06:25,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24" (2/3) ... [2019-11-07 01:06:25,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b9fe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:25, skipping insertion in model container [2019-11-07 01:06:25,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:25" (3/3) ... [2019-11-07 01:06:25,433 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:25,444 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:25,456 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:06:25,469 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:06:25,510 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:25,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:25,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:25,511 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:25,511 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:25,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:25,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:25,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-11-07 01:06:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:25,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:25,577 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] [2019-11-07 01:06:25,579 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-11-07 01:06:25,595 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:25,596 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113599099] [2019-11-07 01:06:25,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:26,176 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:26,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113599099] [2019-11-07 01:06:26,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:26,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:26,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490786730] [2019-11-07 01:06:26,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:26,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:26,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:26,206 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 3 states. [2019-11-07 01:06:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:26,391 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-11-07 01:06:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:26,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-07 01:06:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:26,410 INFO L225 Difference]: With dead ends: 489 [2019-11-07 01:06:26,410 INFO L226 Difference]: Without dead ends: 362 [2019-11-07 01:06:26,415 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:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-07 01:06:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-07 01:06:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-07 01:06:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-11-07 01:06:26,499 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-11-07 01:06:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:26,499 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-11-07 01:06:26,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-11-07 01:06:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:26,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:26,505 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] [2019-11-07 01:06:26,505 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-11-07 01:06:26,506 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:26,506 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833340138] [2019-11-07 01:06:26,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:26,923 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:26,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833340138] [2019-11-07 01:06:26,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:26,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:26,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407951180] [2019-11-07 01:06:26,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:26,927 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:26,928 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-11-07 01:06:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,077 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-11-07 01:06:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:27,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-07 01:06:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,088 INFO L225 Difference]: With dead ends: 1038 [2019-11-07 01:06:27,089 INFO L226 Difference]: Without dead ends: 691 [2019-11-07 01:06:27,097 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:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-07 01:06:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-11-07 01:06:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-07 01:06:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-11-07 01:06:27,191 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-11-07 01:06:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:27,194 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-11-07 01:06:27,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-11-07 01:06:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:06:27,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:27,203 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,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-11-07 01:06:27,208 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:27,208 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108741466] [2019-11-07 01:06:27,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:27,309 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,310 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108741466] [2019-11-07 01:06:27,310 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:27,310 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658084302] [2019-11-07 01:06:27,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:27,313 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:27,314 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 3 states. [2019-11-07 01:06:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,384 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-11-07 01:06:27,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:27,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-07 01:06:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,393 INFO L225 Difference]: With dead ends: 2021 [2019-11-07 01:06:27,393 INFO L226 Difference]: Without dead ends: 1364 [2019-11-07 01:06:27,395 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,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-11-07 01:06:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-11-07 01:06:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-07 01:06:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-11-07 01:06:27,444 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-11-07 01:06:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-11-07 01:06:27,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-11-07 01:06:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:06:27,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:27,447 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:27,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-11-07 01:06:27,448 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:27,448 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661066748] [2019-11-07 01:06:27,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:27,560 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,561 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661066748] [2019-11-07 01:06:27,561 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:27,561 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:27,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148986368] [2019-11-07 01:06:27,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:27,563 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:27,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:27,564 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 3 states. [2019-11-07 01:06:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,707 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-11-07 01:06:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:27,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:06:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,718 INFO L225 Difference]: With dead ends: 1822 [2019-11-07 01:06:27,719 INFO L226 Difference]: Without dead ends: 1330 [2019-11-07 01:06:27,721 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,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-11-07 01:06:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-11-07 01:06:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-11-07 01:06:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-11-07 01:06:27,832 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-11-07 01:06:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:27,832 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-11-07 01:06:27,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-11-07 01:06:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:06:27,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:27,837 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:27,838 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-11-07 01:06:27,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:27,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830243879] [2019-11-07 01:06:27,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,048 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,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830243879] [2019-11-07 01:06:28,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:28,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718294877] [2019-11-07 01:06:28,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:28,051 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:28,052 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 4 states. [2019-11-07 01:06:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,178 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-11-07 01:06:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:28,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-07 01:06:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,187 INFO L225 Difference]: With dead ends: 2157 [2019-11-07 01:06:28,187 INFO L226 Difference]: Without dead ends: 1016 [2019-11-07 01:06:28,190 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,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-07 01:06:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-11-07 01:06:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-11-07 01:06:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-11-07 01:06:28,261 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-11-07 01:06:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,262 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-11-07 01:06:28,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-11-07 01:06:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:06:28,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,265 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,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-11-07 01:06:28,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901030301] [2019-11-07 01:06:28,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,397 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,397 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901030301] [2019-11-07 01:06:28,398 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,398 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060615750] [2019-11-07 01:06:28,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:28,399 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:28,400 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 3 states. [2019-11-07 01:06:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,521 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-11-07 01:06:28,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:28,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:06:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,530 INFO L225 Difference]: With dead ends: 2291 [2019-11-07 01:06:28,531 INFO L226 Difference]: Without dead ends: 1464 [2019-11-07 01:06:28,533 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,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-11-07 01:06:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-11-07 01:06:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-11-07 01:06:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-11-07 01:06:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-11-07 01:06:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,639 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-11-07 01:06:28,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-11-07 01:06:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 01:06:28,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,646 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] [2019-11-07 01:06:28,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-11-07 01:06:28,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,656 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216199866] [2019-11-07 01:06:28,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,744 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,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216199866] [2019-11-07 01:06:28,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:28,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486730202] [2019-11-07 01:06:28,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:28,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:28,746 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 3 states. [2019-11-07 01:06:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,926 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-11-07 01:06:28,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:28,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-07 01:06:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,942 INFO L225 Difference]: With dead ends: 3397 [2019-11-07 01:06:28,942 INFO L226 Difference]: Without dead ends: 2238 [2019-11-07 01:06:28,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:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-11-07 01:06:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-11-07 01:06:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-11-07 01:06:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-11-07 01:06:29,153 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-11-07 01:06:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,153 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-11-07 01:06:29,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-11-07 01:06:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:06:29,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,156 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:29,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-11-07 01:06:29,157 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,157 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148025274] [2019-11-07 01:06:29,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:29,305 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148025274] [2019-11-07 01:06:29,305 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,305 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:29,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191363790] [2019-11-07 01:06:29,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:29,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:29,307 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 5 states. [2019-11-07 01:06:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,701 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-11-07 01:06:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:29,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-07 01:06:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,714 INFO L225 Difference]: With dead ends: 4171 [2019-11-07 01:06:29,714 INFO L226 Difference]: Without dead ends: 2178 [2019-11-07 01:06:29,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-07 01:06:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-11-07 01:06:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-11-07 01:06:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-11-07 01:06:29,899 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-11-07 01:06:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,900 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-11-07 01:06:29,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-11-07 01:06:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:06:29,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,902 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:29,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-11-07 01:06:29,903 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,903 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578566720] [2019-11-07 01:06:29,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,061 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,061 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578566720] [2019-11-07 01:06:30,061 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:30,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055552266] [2019-11-07 01:06:30,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:30,062 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:30,063 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 4 states. [2019-11-07 01:06:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,348 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-11-07 01:06:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:30,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-07 01:06:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,372 INFO L225 Difference]: With dead ends: 5611 [2019-11-07 01:06:30,372 INFO L226 Difference]: Without dead ends: 3458 [2019-11-07 01:06:30,380 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,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-11-07 01:06:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-11-07 01:06:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-11-07 01:06:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-11-07 01:06:30,757 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-11-07 01:06:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,757 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-11-07 01:06:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-11-07 01:06:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-07 01:06:30,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,760 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] [2019-11-07 01:06:30,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-11-07 01:06:30,761 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,761 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179960152] [2019-11-07 01:06:30,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,857 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,858 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179960152] [2019-11-07 01:06:30,858 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,858 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:30,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602871072] [2019-11-07 01:06:30,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:30,859 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:30,860 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 3 states. [2019-11-07 01:06:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,331 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-11-07 01:06:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:31,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-07 01:06:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,365 INFO L225 Difference]: With dead ends: 9594 [2019-11-07 01:06:31,366 INFO L226 Difference]: Without dead ends: 6514 [2019-11-07 01:06:31,372 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:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-11-07 01:06:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-11-07 01:06:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-11-07 01:06:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-11-07 01:06:31,793 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-11-07 01:06:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,793 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-11-07 01:06:31,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-11-07 01:06:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-07 01:06:31,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,798 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] [2019-11-07 01:06:31,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-11-07 01:06:31,799 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,799 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253254418] [2019-11-07 01:06:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,917 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,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253254418] [2019-11-07 01:06:31,918 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,918 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:31,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897508405] [2019-11-07 01:06:31,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:31,919 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:31,919 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 4 states. [2019-11-07 01:06:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:32,289 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-11-07 01:06:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:32,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-07 01:06:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:32,319 INFO L225 Difference]: With dead ends: 10292 [2019-11-07 01:06:32,319 INFO L226 Difference]: Without dead ends: 5311 [2019-11-07 01:06:32,330 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:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-11-07 01:06:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-11-07 01:06:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-11-07 01:06:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-11-07 01:06:32,619 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-11-07 01:06:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:32,620 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-11-07 01:06:32,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-11-07 01:06:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-07 01:06:32,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:32,624 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] [2019-11-07 01:06:32,624 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:32,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-11-07 01:06:32,625 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:32,625 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575032222] [2019-11-07 01:06:32,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:32,774 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:32,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575032222] [2019-11-07 01:06:32,776 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:32,777 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:32,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778696365] [2019-11-07 01:06:32,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:32,778 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:32,778 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 3 states. [2019-11-07 01:06:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:33,208 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-11-07 01:06:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:33,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-07 01:06:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:33,246 INFO L225 Difference]: With dead ends: 13935 [2019-11-07 01:06:33,247 INFO L226 Difference]: Without dead ends: 8965 [2019-11-07 01:06:33,262 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,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-11-07 01:06:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-11-07 01:06:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-11-07 01:06:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-11-07 01:06:33,907 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-11-07 01:06:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:33,907 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-11-07 01:06:33,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-11-07 01:06:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:06:33,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:33,912 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:33,912 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-11-07 01:06:33,913 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:33,913 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712034980] [2019-11-07 01:06:33,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:34,102 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,102 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712034980] [2019-11-07 01:06:34,102 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:34,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:34,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780019415] [2019-11-07 01:06:34,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:34,104 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:34,105 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 4 states. [2019-11-07 01:06:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:35,065 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-11-07 01:06:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:35,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:06:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:35,105 INFO L225 Difference]: With dead ends: 24205 [2019-11-07 01:06:35,105 INFO L226 Difference]: Without dead ends: 15565 [2019-11-07 01:06:35,124 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:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-11-07 01:06:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-11-07 01:06:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-11-07 01:06:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-11-07 01:06:36,015 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-11-07 01:06:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:36,015 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-11-07 01:06:36,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-11-07 01:06:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-07 01:06:36,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:36,021 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:36,021 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-11-07 01:06:36,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:36,022 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198826710] [2019-11-07 01:06:36,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:36,073 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:36,074 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198826710] [2019-11-07 01:06:36,074 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:36,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:36,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558462659] [2019-11-07 01:06:36,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:36,075 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:36,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:36,076 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 3 states. [2019-11-07 01:06:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:38,506 INFO L93 Difference]: Finished difference Result 46487 states and 71527 transitions. [2019-11-07 01:06:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:38,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-07 01:06:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:38,580 INFO L225 Difference]: With dead ends: 46487 [2019-11-07 01:06:38,581 INFO L226 Difference]: Without dead ends: 31034 [2019-11-07 01:06:38,613 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:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-11-07 01:06:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-11-07 01:06:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-11-07 01:06:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-11-07 01:06:39,460 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-11-07 01:06:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:39,460 INFO L462 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-11-07 01:06:39,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-11-07 01:06:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-07 01:06:39,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:39,466 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:39,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-11-07 01:06:39,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:39,467 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621977328] [2019-11-07 01:06:39,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:39,581 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:39,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621977328] [2019-11-07 01:06:39,582 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:39,582 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:39,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477699974] [2019-11-07 01:06:39,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:39,583 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:39,584 INFO L87 Difference]: Start difference. First operand 15569 states and 23934 transitions. Second operand 4 states. [2019-11-07 01:06:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:40,197 INFO L93 Difference]: Finished difference Result 31096 states and 47812 transitions. [2019-11-07 01:06:40,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:40,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-07 01:06:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:40,226 INFO L225 Difference]: With dead ends: 31096 [2019-11-07 01:06:40,227 INFO L226 Difference]: Without dead ends: 15563 [2019-11-07 01:06:40,260 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:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-11-07 01:06:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15563. [2019-11-07 01:06:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-11-07 01:06:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23922 transitions. [2019-11-07 01:06:41,067 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23922 transitions. Word has length 116 [2019-11-07 01:06:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:41,067 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23922 transitions. [2019-11-07 01:06:41,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23922 transitions. [2019-11-07 01:06:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-07 01:06:41,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:41,071 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,072 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1204434274, now seen corresponding path program 1 times [2019-11-07 01:06:41,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:41,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825723343] [2019-11-07 01:06:41,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:41,156 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,160 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825723343] [2019-11-07 01:06:41,162 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:41,162 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:41,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91929903] [2019-11-07 01:06:41,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:41,163 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:41,164 INFO L87 Difference]: Start difference. First operand 15563 states and 23922 transitions. Second operand 3 states. [2019-11-07 01:06:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:42,128 INFO L93 Difference]: Finished difference Result 37297 states and 57457 transitions. [2019-11-07 01:06:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:42,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-07 01:06:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:42,160 INFO L225 Difference]: With dead ends: 37297 [2019-11-07 01:06:42,160 INFO L226 Difference]: Without dead ends: 22487 [2019-11-07 01:06:42,179 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:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-11-07 01:06:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 22485. [2019-11-07 01:06:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22485 states. [2019-11-07 01:06:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22485 states to 22485 states and 34047 transitions. [2019-11-07 01:06:43,313 INFO L78 Accepts]: Start accepts. Automaton has 22485 states and 34047 transitions. Word has length 116 [2019-11-07 01:06:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,314 INFO L462 AbstractCegarLoop]: Abstraction has 22485 states and 34047 transitions. [2019-11-07 01:06:43,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22485 states and 34047 transitions. [2019-11-07 01:06:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-07 01:06:43,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,319 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, 1, 1] [2019-11-07 01:06:43,320 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash 306834164, now seen corresponding path program 1 times [2019-11-07 01:06:43,320 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457869307] [2019-11-07 01:06:43,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,409 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:43,410 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457869307] [2019-11-07 01:06:43,410 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,410 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:43,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392665132] [2019-11-07 01:06:43,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:43,411 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:43,412 INFO L87 Difference]: Start difference. First operand 22485 states and 34047 transitions. Second operand 3 states. [2019-11-07 01:06:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:45,649 INFO L93 Difference]: Finished difference Result 61641 states and 95217 transitions. [2019-11-07 01:06:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:45,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-07 01:06:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:45,712 INFO L225 Difference]: With dead ends: 61641 [2019-11-07 01:06:45,713 INFO L226 Difference]: Without dead ends: 42063 [2019-11-07 01:06:45,744 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:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42063 states. [2019-11-07 01:06:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42063 to 41977. [2019-11-07 01:06:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41977 states. [2019-11-07 01:06:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41977 states to 41977 states and 63515 transitions. [2019-11-07 01:06:47,715 INFO L78 Accepts]: Start accepts. Automaton has 41977 states and 63515 transitions. Word has length 119 [2019-11-07 01:06:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,715 INFO L462 AbstractCegarLoop]: Abstraction has 41977 states and 63515 transitions. [2019-11-07 01:06:47,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41977 states and 63515 transitions. [2019-11-07 01:06:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-07 01:06:47,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,720 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, 1, 1] [2019-11-07 01:06:47,721 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2137277520, now seen corresponding path program 1 times [2019-11-07 01:06:47,721 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,722 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675053173] [2019-11-07 01:06:47,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:48,003 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:48,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675053173] [2019-11-07 01:06:48,003 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:48,003 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:06:48,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736848939] [2019-11-07 01:06:48,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:06:48,004 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:06:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:06:48,005 INFO L87 Difference]: Start difference. First operand 41977 states and 63515 transitions. Second operand 12 states. [2019-11-07 01:06:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,430 INFO L93 Difference]: Finished difference Result 157307 states and 240454 transitions. [2019-11-07 01:06:55,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:06:55,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-11-07 01:06:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:55,610 INFO L225 Difference]: With dead ends: 157307 [2019-11-07 01:06:55,610 INFO L226 Difference]: Without dead ends: 117623 [2019-11-07 01:06:55,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-07 01:06:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117623 states.