/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_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:12,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:12,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:12,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:12,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:12,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:12,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:12,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:12,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:12,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:12,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:12,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:12,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:12,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:12,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:12,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:12,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:12,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:12,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:12,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:12,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:12,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:12,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:12,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:12,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:12,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:12,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:12,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:12,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:12,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:12,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:12,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:12,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:12,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:12,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:12,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:12,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:12,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:12,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:12,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:12,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:12,099 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:05:12,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:12,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:12,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:12,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:12,129 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:12,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:12,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:12,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:12,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:12,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:12,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:12,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:12,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:12,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:12,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:12,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:12,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:12,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:12,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:12,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:12,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:12,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:12,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:12,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:12,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:12,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:12,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:12,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:12,133 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:05:12,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:12,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:12,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:12,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:12,440 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:12,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:05:12,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc7e63a9/557ccfc28a7e43df8e862651db02b4ab/FLAGc67433110 [2019-11-07 01:05:12,957 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:12,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:05:12,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc7e63a9/557ccfc28a7e43df8e862651db02b4ab/FLAGc67433110 [2019-11-07 01:05:13,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc7e63a9/557ccfc28a7e43df8e862651db02b4ab [2019-11-07 01:05:13,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:13,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:13,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:13,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:13,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:13,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:13" (1/1) ... [2019-11-07 01:05:13,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc84bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:13, skipping insertion in model container [2019-11-07 01:05:13,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:13" (1/1) ... [2019-11-07 01:05:13,287 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:13,361 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:13,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:14,008 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:14,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:14,197 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:14,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14 WrapperNode [2019-11-07 01:05:14,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:14,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:14,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:14,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:14,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:14,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:14,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:14,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:14,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (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:05:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:05:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:14,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:15,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:15,789 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:15,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:15 BoogieIcfgContainer [2019-11-07 01:05:15,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:15,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:15,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:15,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:15,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:13" (1/3) ... [2019-11-07 01:05:15,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707f1ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:15, skipping insertion in model container [2019-11-07 01:05:15,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (2/3) ... [2019-11-07 01:05:15,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707f1ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:15, skipping insertion in model container [2019-11-07 01:05:15,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:15" (3/3) ... [2019-11-07 01:05:15,798 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:05:15,808 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:15,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:05:15,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:05:15,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:15,856 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:15,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:15,856 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:15,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:15,857 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:15,857 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:15,857 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-11-07 01:05:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:15,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:15,898 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, 1, 1, 1, 1, 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:05:15,899 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1464169863, now seen corresponding path program 1 times [2019-11-07 01:05:15,912 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:15,912 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562853962] [2019-11-07 01:05:15,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:16,618 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:05:16,618 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562853962] [2019-11-07 01:05:16,619 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:16,620 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:16,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815318641] [2019-11-07 01:05:16,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:16,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:16,647 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 3 states. [2019-11-07 01:05:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:16,895 INFO L93 Difference]: Finished difference Result 619 states and 1086 transitions. [2019-11-07 01:05:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:16,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-07 01:05:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:16,928 INFO L225 Difference]: With dead ends: 619 [2019-11-07 01:05:16,929 INFO L226 Difference]: Without dead ends: 492 [2019-11-07 01:05:16,935 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:05:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-11-07 01:05:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2019-11-07 01:05:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-07 01:05:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2019-11-07 01:05:17,054 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 147 [2019-11-07 01:05:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:17,055 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2019-11-07 01:05:17,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2019-11-07 01:05:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:17,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:17,060 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, 1, 1, 1, 1, 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:05:17,060 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:17,061 INFO L82 PathProgramCache]: Analyzing trace with hash 558735771, now seen corresponding path program 1 times [2019-11-07 01:05:17,061 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:17,061 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98859340] [2019-11-07 01:05:17,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:17,233 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:05:17,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98859340] [2019-11-07 01:05:17,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:17,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:17,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530935343] [2019-11-07 01:05:17,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:17,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:17,237 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand 3 states. [2019-11-07 01:05:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:17,382 INFO L93 Difference]: Finished difference Result 1032 states and 1578 transitions. [2019-11-07 01:05:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:17,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-07 01:05:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:17,393 INFO L225 Difference]: With dead ends: 1032 [2019-11-07 01:05:17,394 INFO L226 Difference]: Without dead ends: 840 [2019-11-07 01:05:17,400 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:05:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-11-07 01:05:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-11-07 01:05:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-07 01:05:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1255 transitions. [2019-11-07 01:05:17,458 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1255 transitions. Word has length 147 [2019-11-07 01:05:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:17,461 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1255 transitions. [2019-11-07 01:05:17,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1255 transitions. [2019-11-07 01:05:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:17,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:17,470 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, 1, 1, 1, 1, 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:05:17,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:17,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1754446721, now seen corresponding path program 1 times [2019-11-07 01:05:17,473 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:17,473 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149436396] [2019-11-07 01:05:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:17,979 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:05:17,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149436396] [2019-11-07 01:05:17,981 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:17,981 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:17,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538438116] [2019-11-07 01:05:17,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:17,984 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:17,990 INFO L87 Difference]: Start difference. First operand 838 states and 1255 transitions. Second operand 4 states. [2019-11-07 01:05:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,191 INFO L93 Difference]: Finished difference Result 2461 states and 3682 transitions. [2019-11-07 01:05:18,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:18,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:05:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,207 INFO L225 Difference]: With dead ends: 2461 [2019-11-07 01:05:18,216 INFO L226 Difference]: Without dead ends: 1636 [2019-11-07 01:05:18,223 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:05:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-11-07 01:05:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1634. [2019-11-07 01:05:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-07 01:05:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2428 transitions. [2019-11-07 01:05:18,361 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2428 transitions. Word has length 147 [2019-11-07 01:05:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,361 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2428 transitions. [2019-11-07 01:05:18,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2428 transitions. [2019-11-07 01:05:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-07 01:05:18,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,367 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, 1, 1, 1, 1, 1, 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:05:18,368 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash 818598479, now seen corresponding path program 1 times [2019-11-07 01:05:18,369 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,369 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750599957] [2019-11-07 01:05:18,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,481 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:05:18,482 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750599957] [2019-11-07 01:05:18,482 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:18,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959638290] [2019-11-07 01:05:18,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:18,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:18,484 INFO L87 Difference]: Start difference. First operand 1634 states and 2428 transitions. Second operand 3 states. [2019-11-07 01:05:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,660 INFO L93 Difference]: Finished difference Result 4856 states and 7214 transitions. [2019-11-07 01:05:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:18,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-07 01:05:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,677 INFO L225 Difference]: With dead ends: 4856 [2019-11-07 01:05:18,677 INFO L226 Difference]: Without dead ends: 3254 [2019-11-07 01:05:18,682 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:05:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-11-07 01:05:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 1636. [2019-11-07 01:05:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-11-07 01:05:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2430 transitions. [2019-11-07 01:05:18,803 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2430 transitions. Word has length 148 [2019-11-07 01:05:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,804 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2430 transitions. [2019-11-07 01:05:18,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2430 transitions. [2019-11-07 01:05:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:05:18,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,808 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, 1, 1, 1, 1, 1, 1, 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:05:18,808 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash -77658400, now seen corresponding path program 1 times [2019-11-07 01:05:18,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022415605] [2019-11-07 01:05:18,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,020 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:05:19,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022415605] [2019-11-07 01:05:19,022 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,022 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:19,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045998209] [2019-11-07 01:05:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:19,023 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:19,024 INFO L87 Difference]: Start difference. First operand 1636 states and 2430 transitions. Second operand 4 states. [2019-11-07 01:05:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:19,170 INFO L93 Difference]: Finished difference Result 3258 states and 4842 transitions. [2019-11-07 01:05:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:19,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-07 01:05:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:19,182 INFO L225 Difference]: With dead ends: 3258 [2019-11-07 01:05:19,182 INFO L226 Difference]: Without dead ends: 1634 [2019-11-07 01:05:19,187 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:05:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-07 01:05:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2019-11-07 01:05:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-07 01:05:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2426 transitions. [2019-11-07 01:05:19,334 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2426 transitions. Word has length 149 [2019-11-07 01:05:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,334 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2426 transitions. [2019-11-07 01:05:19,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2426 transitions. [2019-11-07 01:05:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:05:19,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,341 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, 1, 1, 1, 1, 1, 1, 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:05:19,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -381277494, now seen corresponding path program 1 times [2019-11-07 01:05:19,342 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229285449] [2019-11-07 01:05:19,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,615 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:05:19,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229285449] [2019-11-07 01:05:19,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,617 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:19,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748214440] [2019-11-07 01:05:19,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:19,619 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:19,620 INFO L87 Difference]: Start difference. First operand 1634 states and 2426 transitions. Second operand 3 states. [2019-11-07 01:05:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:19,809 INFO L93 Difference]: Finished difference Result 3870 states and 5761 transitions. [2019-11-07 01:05:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:19,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-07 01:05:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:19,824 INFO L225 Difference]: With dead ends: 3870 [2019-11-07 01:05:19,825 INFO L226 Difference]: Without dead ends: 2414 [2019-11-07 01:05:19,828 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:05:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-07 01:05:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-11-07 01:05:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-11-07 01:05:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3535 transitions. [2019-11-07 01:05:19,993 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3535 transitions. Word has length 149 [2019-11-07 01:05:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,994 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3535 transitions. [2019-11-07 01:05:19,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3535 transitions. [2019-11-07 01:05:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:20,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:20,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:20,005 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1397721559, now seen corresponding path program 1 times [2019-11-07 01:05:20,008 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:20,009 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877053721] [2019-11-07 01:05:20,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:20,222 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:05:20,222 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877053721] [2019-11-07 01:05:20,222 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:20,223 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:20,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837351794] [2019-11-07 01:05:20,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:20,224 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:20,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:20,224 INFO L87 Difference]: Start difference. First operand 2412 states and 3535 transitions. Second operand 5 states. [2019-11-07 01:05:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:20,692 INFO L93 Difference]: Finished difference Result 4658 states and 6855 transitions. [2019-11-07 01:05:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:20,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-07 01:05:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:20,704 INFO L225 Difference]: With dead ends: 4658 [2019-11-07 01:05:20,704 INFO L226 Difference]: Without dead ends: 2414 [2019-11-07 01:05:20,709 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:05:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-07 01:05:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-11-07 01:05:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-11-07 01:05:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3520 transitions. [2019-11-07 01:05:20,854 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3520 transitions. Word has length 152 [2019-11-07 01:05:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:20,855 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3520 transitions. [2019-11-07 01:05:20,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3520 transitions. [2019-11-07 01:05:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:20,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:20,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:20,860 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1633318332, now seen corresponding path program 1 times [2019-11-07 01:05:20,861 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:20,861 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206443518] [2019-11-07 01:05:20,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:21,107 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:05:21,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206443518] [2019-11-07 01:05:21,107 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:21,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:21,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949792915] [2019-11-07 01:05:21,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:21,109 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:21,110 INFO L87 Difference]: Start difference. First operand 2412 states and 3520 transitions. Second operand 4 states. [2019-11-07 01:05:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:21,505 INFO L93 Difference]: Finished difference Result 6242 states and 9103 transitions. [2019-11-07 01:05:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:21,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:05:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:21,523 INFO L225 Difference]: With dead ends: 6242 [2019-11-07 01:05:21,523 INFO L226 Difference]: Without dead ends: 3853 [2019-11-07 01:05:21,528 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:05:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-11-07 01:05:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2019-11-07 01:05:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3851 states. [2019-11-07 01:05:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5567 transitions. [2019-11-07 01:05:21,760 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5567 transitions. Word has length 152 [2019-11-07 01:05:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 3851 states and 5567 transitions. [2019-11-07 01:05:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5567 transitions. [2019-11-07 01:05:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:05:21,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:21,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:21,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash -83620211, now seen corresponding path program 1 times [2019-11-07 01:05:21,770 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:21,770 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943950098] [2019-11-07 01:05:21,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:21,881 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943950098] [2019-11-07 01:05:21,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:21,882 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:21,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318569961] [2019-11-07 01:05:21,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:21,884 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:21,885 INFO L87 Difference]: Start difference. First operand 3851 states and 5567 transitions. Second operand 3 states. [2019-11-07 01:05:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:22,291 INFO L93 Difference]: Finished difference Result 10239 states and 14831 transitions. [2019-11-07 01:05:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:22,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-07 01:05:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:22,332 INFO L225 Difference]: With dead ends: 10239 [2019-11-07 01:05:22,332 INFO L226 Difference]: Without dead ends: 6731 [2019-11-07 01:05:22,343 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:05:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2019-11-07 01:05:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6729. [2019-11-07 01:05:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2019-11-07 01:05:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 9603 transitions. [2019-11-07 01:05:22,867 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 9603 transitions. Word has length 154 [2019-11-07 01:05:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:22,869 INFO L462 AbstractCegarLoop]: Abstraction has 6729 states and 9603 transitions. [2019-11-07 01:05:22,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 9603 transitions. [2019-11-07 01:05:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:05:22,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:22,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:22,879 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash 423811114, now seen corresponding path program 1 times [2019-11-07 01:05:22,880 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:22,880 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842014967] [2019-11-07 01:05:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:23,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:05:23,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842014967] [2019-11-07 01:05:23,062 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:23,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:23,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258377458] [2019-11-07 01:05:23,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:23,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:23,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:23,065 INFO L87 Difference]: Start difference. First operand 6729 states and 9603 transitions. Second operand 4 states. [2019-11-07 01:05:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:23,421 INFO L93 Difference]: Finished difference Result 11002 states and 15732 transitions. [2019-11-07 01:05:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:05:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:23,459 INFO L225 Difference]: With dead ends: 11002 [2019-11-07 01:05:23,460 INFO L226 Difference]: Without dead ends: 5964 [2019-11-07 01:05:23,474 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:05:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-11-07 01:05:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5964. [2019-11-07 01:05:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-11-07 01:05:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 8508 transitions. [2019-11-07 01:05:23,766 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 8508 transitions. Word has length 154 [2019-11-07 01:05:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 8508 transitions. [2019-11-07 01:05:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 8508 transitions. [2019-11-07 01:05:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:05:23,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:23,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,776 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 923876710, now seen corresponding path program 1 times [2019-11-07 01:05:23,777 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:23,777 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992263164] [2019-11-07 01:05:23,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:23,972 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:05:23,972 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992263164] [2019-11-07 01:05:23,973 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:23,973 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:23,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749953306] [2019-11-07 01:05:23,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:23,974 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:23,975 INFO L87 Difference]: Start difference. First operand 5964 states and 8508 transitions. Second operand 4 states. [2019-11-07 01:05:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:24,582 INFO L93 Difference]: Finished difference Result 17410 states and 24777 transitions. [2019-11-07 01:05:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:24,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-07 01:05:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:24,608 INFO L225 Difference]: With dead ends: 17410 [2019-11-07 01:05:24,608 INFO L226 Difference]: Without dead ends: 11489 [2019-11-07 01:05:24,622 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:05:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2019-11-07 01:05:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11487. [2019-11-07 01:05:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-11-07 01:05:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 16184 transitions. [2019-11-07 01:05:25,454 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 16184 transitions. Word has length 157 [2019-11-07 01:05:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:25,455 INFO L462 AbstractCegarLoop]: Abstraction has 11487 states and 16184 transitions. [2019-11-07 01:05:25,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 16184 transitions. [2019-11-07 01:05:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:25,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:25,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:25,483 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2109819854, now seen corresponding path program 1 times [2019-11-07 01:05:25,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:25,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200017346] [2019-11-07 01:05:25,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:25,558 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:05:25,558 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200017346] [2019-11-07 01:05:25,559 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:25,559 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:25,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674592247] [2019-11-07 01:05:25,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:25,560 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:25,561 INFO L87 Difference]: Start difference. First operand 11487 states and 16184 transitions. Second operand 3 states. [2019-11-07 01:05:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:26,763 INFO L93 Difference]: Finished difference Result 34269 states and 48305 transitions. [2019-11-07 01:05:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:26,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:05:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:26,824 INFO L225 Difference]: With dead ends: 34269 [2019-11-07 01:05:26,825 INFO L226 Difference]: Without dead ends: 22887 [2019-11-07 01:05:26,855 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:05:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22887 states. [2019-11-07 01:05:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22887 to 11493. [2019-11-07 01:05:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11493 states. [2019-11-07 01:05:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 16190 transitions. [2019-11-07 01:05:28,322 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 16190 transitions. Word has length 158 [2019-11-07 01:05:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:28,322 INFO L462 AbstractCegarLoop]: Abstraction has 11493 states and 16190 transitions. [2019-11-07 01:05:28,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 16190 transitions. [2019-11-07 01:05:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:05:28,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:28,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,339 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1177749259, now seen corresponding path program 1 times [2019-11-07 01:05:28,340 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:28,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969595861] [2019-11-07 01:05:28,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:28,445 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:05:28,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969595861] [2019-11-07 01:05:28,446 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:28,446 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:28,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473252064] [2019-11-07 01:05:28,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:28,447 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:28,448 INFO L87 Difference]: Start difference. First operand 11493 states and 16190 transitions. Second operand 3 states. [2019-11-07 01:05:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:29,337 INFO L93 Difference]: Finished difference Result 30661 states and 43120 transitions. [2019-11-07 01:05:29,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:29,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-07 01:05:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:29,376 INFO L225 Difference]: With dead ends: 30661 [2019-11-07 01:05:29,376 INFO L226 Difference]: Without dead ends: 19849 [2019-11-07 01:05:29,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:05:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19849 states. [2019-11-07 01:05:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19849 to 19847. [2019-11-07 01:05:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19847 states. [2019-11-07 01:05:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19847 states to 19847 states and 27468 transitions. [2019-11-07 01:05:30,431 INFO L78 Accepts]: Start accepts. Automaton has 19847 states and 27468 transitions. Word has length 159 [2019-11-07 01:05:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:30,432 INFO L462 AbstractCegarLoop]: Abstraction has 19847 states and 27468 transitions. [2019-11-07 01:05:30,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19847 states and 27468 transitions. [2019-11-07 01:05:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:05:30,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:30,466 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -220529586, now seen corresponding path program 1 times [2019-11-07 01:05:30,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:30,467 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343868795] [2019-11-07 01:05:30,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:30,729 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:05:30,729 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343868795] [2019-11-07 01:05:30,730 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:30,730 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:30,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568841721] [2019-11-07 01:05:30,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:30,731 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:30,731 INFO L87 Difference]: Start difference. First operand 19847 states and 27468 transitions. Second operand 4 states. [2019-11-07 01:05:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:31,636 INFO L93 Difference]: Finished difference Result 36277 states and 50352 transitions. [2019-11-07 01:05:31,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:31,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:05:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:31,677 INFO L225 Difference]: With dead ends: 36277 [2019-11-07 01:05:31,677 INFO L226 Difference]: Without dead ends: 17049 [2019-11-07 01:05:31,711 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:05:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17049 states. [2019-11-07 01:05:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17049 to 17049. [2019-11-07 01:05:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17049 states. [2019-11-07 01:05:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 23607 transitions. [2019-11-07 01:05:32,774 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 23607 transitions. Word has length 159 [2019-11-07 01:05:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:32,775 INFO L462 AbstractCegarLoop]: Abstraction has 17049 states and 23607 transitions. [2019-11-07 01:05:32,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 23607 transitions. [2019-11-07 01:05:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:05:32,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:32,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,792 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash -888345886, now seen corresponding path program 1 times [2019-11-07 01:05:32,792 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:32,793 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514565250] [2019-11-07 01:05:32,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:32,964 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:05:32,964 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514565250] [2019-11-07 01:05:32,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:32,965 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:32,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937079278] [2019-11-07 01:05:32,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:32,966 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:32,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:32,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:32,966 INFO L87 Difference]: Start difference. First operand 17049 states and 23607 transitions. Second operand 5 states. [2019-11-07 01:05:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,604 INFO L93 Difference]: Finished difference Result 47742 states and 66753 transitions. [2019-11-07 01:05:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:34,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-11-07 01:05:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,661 INFO L225 Difference]: With dead ends: 47742 [2019-11-07 01:05:34,661 INFO L226 Difference]: Without dead ends: 32329 [2019-11-07 01:05:34,684 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:05:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32329 states. [2019-11-07 01:05:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32329 to 32327. [2019-11-07 01:05:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32327 states. [2019-11-07 01:05:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32327 states to 32327 states and 44631 transitions. [2019-11-07 01:05:36,828 INFO L78 Accepts]: Start accepts. Automaton has 32327 states and 44631 transitions. Word has length 165 [2019-11-07 01:05:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:36,829 INFO L462 AbstractCegarLoop]: Abstraction has 32327 states and 44631 transitions. [2019-11-07 01:05:36,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 32327 states and 44631 transitions. [2019-11-07 01:05:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:05:36,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:36,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,857 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1990153662, now seen corresponding path program 1 times [2019-11-07 01:05:36,858 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:36,858 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767310823] [2019-11-07 01:05:36,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:37,064 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:05:37,070 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767310823] [2019-11-07 01:05:37,073 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:37,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:37,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661066390] [2019-11-07 01:05:37,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:37,075 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:37,075 INFO L87 Difference]: Start difference. First operand 32327 states and 44631 transitions. Second operand 6 states. [2019-11-07 01:05:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:40,015 INFO L93 Difference]: Finished difference Result 74095 states and 110339 transitions. [2019-11-07 01:05:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:40,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-11-07 01:05:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:40,104 INFO L225 Difference]: With dead ends: 74095 [2019-11-07 01:05:40,104 INFO L226 Difference]: Without dead ends: 60045 [2019-11-07 01:05:40,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60045 states. [2019-11-07 01:05:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60045 to 59751. [2019-11-07 01:05:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59751 states. [2019-11-07 01:05:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59751 states to 59751 states and 87443 transitions. [2019-11-07 01:05:44,282 INFO L78 Accepts]: Start accepts. Automaton has 59751 states and 87443 transitions. Word has length 165 [2019-11-07 01:05:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:44,283 INFO L462 AbstractCegarLoop]: Abstraction has 59751 states and 87443 transitions. [2019-11-07 01:05:44,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59751 states and 87443 transitions. [2019-11-07 01:05:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:05:44,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:44,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,296 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash -794442712, now seen corresponding path program 1 times [2019-11-07 01:05:44,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:44,297 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323792976] [2019-11-07 01:05:44,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat