/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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:50,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:50,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:50,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:50,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:50,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:50,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:51,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:51,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:51,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:51,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:51,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:51,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:51,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:51,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:51,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:51,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:51,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:51,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:51,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:51,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:51,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:51,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:51,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:51,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:51,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:51,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:51,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:51,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:51,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:51,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:51,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:51,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:51,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:51,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:51,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:51,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:51,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:51,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:51,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:51,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:51,030 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:04:51,044 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:51,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:51,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:51,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:51,046 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:51,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:51,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:51,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:51,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:51,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:51,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:51,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:51,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:51,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:51,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:51,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:51,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:51,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:51,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:51,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:51,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:51,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:51,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:51,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:51,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:51,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:51,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:51,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:51,052 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:04:51,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:51,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:51,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:51,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:51,343 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:51,344 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:04:51,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b20104cc/3242911a79da4a56bfd74908825a8536/FLAGe9b062aba [2019-11-07 01:04:51,997 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:52,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:04:52,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b20104cc/3242911a79da4a56bfd74908825a8536/FLAGe9b062aba [2019-11-07 01:04:52,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b20104cc/3242911a79da4a56bfd74908825a8536 [2019-11-07 01:04:52,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:52,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:52,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:52,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:52,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:52,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:52" (1/1) ... [2019-11-07 01:04:52,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e5946d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:52, skipping insertion in model container [2019-11-07 01:04:52,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:52" (1/1) ... [2019-11-07 01:04:52,335 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:52,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:52,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:52,892 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:53,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:53,095 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:53,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53 WrapperNode [2019-11-07 01:04:53,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:53,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:53,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:53,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:53,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:53,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:53,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:53,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:53,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (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:04:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:04:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:54,725 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:54,725 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:54,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:54 BoogieIcfgContainer [2019-11-07 01:04:54,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:54,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:54,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:54,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:54,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:52" (1/3) ... [2019-11-07 01:04:54,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c099f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:54, skipping insertion in model container [2019-11-07 01:04:54,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (2/3) ... [2019-11-07 01:04:54,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c099f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:54, skipping insertion in model container [2019-11-07 01:04:54,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:54" (3/3) ... [2019-11-07 01:04:54,735 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:04:54,744 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:54,753 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:04:54,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:04:54,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:54,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:54,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:54,793 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:54,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:54,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:54,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:54,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-11-07 01:04:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:04:54,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,836 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] [2019-11-07 01:04:54,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-11-07 01:04:54,851 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,851 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391277619] [2019-11-07 01:04:54,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:55,486 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:04:55,487 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391277619] [2019-11-07 01:04:55,488 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:55,488 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:55,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192753140] [2019-11-07 01:04:55,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:55,497 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:55,515 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-11-07 01:04:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:55,756 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-11-07 01:04:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:55,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-07 01:04:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:55,779 INFO L225 Difference]: With dead ends: 641 [2019-11-07 01:04:55,779 INFO L226 Difference]: Without dead ends: 514 [2019-11-07 01:04:55,785 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:04:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-07 01:04:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-07 01:04:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-07 01:04:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-11-07 01:04:55,947 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-11-07 01:04:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:55,951 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-11-07 01:04:55,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-11-07 01:04:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:04:55,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:55,962 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] [2019-11-07 01:04:55,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-11-07 01:04:55,963 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:55,964 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449057668] [2019-11-07 01:04:55,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,194 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:04:56,194 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449057668] [2019-11-07 01:04:56,194 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,195 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:56,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237470289] [2019-11-07 01:04:56,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:56,198 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:56,199 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-11-07 01:04:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:56,322 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-11-07 01:04:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:56,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-07 01:04:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:56,328 INFO L225 Difference]: With dead ends: 1076 [2019-11-07 01:04:56,329 INFO L226 Difference]: Without dead ends: 884 [2019-11-07 01:04:56,332 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:04:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-11-07 01:04:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-11-07 01:04:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-11-07 01:04:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-11-07 01:04:56,388 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-11-07 01:04:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:56,389 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-11-07 01:04:56,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-11-07 01:04:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:04:56,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:56,392 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] [2019-11-07 01:04:56,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-11-07 01:04:56,395 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:56,395 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635116094] [2019-11-07 01:04:56,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,851 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:04:56,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635116094] [2019-11-07 01:04:56,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:56,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259567438] [2019-11-07 01:04:56,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:56,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:56,854 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-11-07 01:04:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,036 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-11-07 01:04:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:57,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-07 01:04:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,048 INFO L225 Difference]: With dead ends: 2577 [2019-11-07 01:04:57,048 INFO L226 Difference]: Without dead ends: 1708 [2019-11-07 01:04:57,052 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:04:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-11-07 01:04:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-11-07 01:04:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-11-07 01:04:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-11-07 01:04:57,161 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-11-07 01:04:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,161 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-11-07 01:04:57,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-11-07 01:04:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:04:57,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,168 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] [2019-11-07 01:04:57,168 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-11-07 01:04:57,169 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143083630] [2019-11-07 01:04:57,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,272 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:04:57,272 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143083630] [2019-11-07 01:04:57,272 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,273 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:57,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924128210] [2019-11-07 01:04:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:57,274 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:57,274 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-11-07 01:04:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,409 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-11-07 01:04:57,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:57,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-07 01:04:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,427 INFO L225 Difference]: With dead ends: 5072 [2019-11-07 01:04:57,427 INFO L226 Difference]: Without dead ends: 3398 [2019-11-07 01:04:57,432 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:04:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-07 01:04:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-11-07 01:04:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-11-07 01:04:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-11-07 01:04:57,540 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-11-07 01:04:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,540 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-11-07 01:04:57,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-11-07 01:04:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:04:57,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,544 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:04:57,544 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-11-07 01:04:57,545 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,545 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829293398] [2019-11-07 01:04:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,664 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:04:57,665 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829293398] [2019-11-07 01:04:57,665 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,665 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:57,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080887820] [2019-11-07 01:04:57,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:57,666 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:57,667 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-11-07 01:04:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,915 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-11-07 01:04:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:57,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:04:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,932 INFO L225 Difference]: With dead ends: 4838 [2019-11-07 01:04:57,932 INFO L226 Difference]: Without dead ends: 3310 [2019-11-07 01:04:57,936 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:04:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-11-07 01:04:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-11-07 01:04:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-11-07 01:04:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-11-07 01:04:58,120 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-11-07 01:04:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:58,120 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-11-07 01:04:58,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-11-07 01:04:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:04:58,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:58,127 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:04:58,127 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-11-07 01:04:58,128 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:58,128 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88647521] [2019-11-07 01:04:58,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,284 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:04:58,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88647521] [2019-11-07 01:04:58,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,286 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:58,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381410181] [2019-11-07 01:04:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:58,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:58,287 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-11-07 01:04:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:58,486 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-11-07 01:04:58,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:58,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:04:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:58,500 INFO L225 Difference]: With dead ends: 5666 [2019-11-07 01:04:58,501 INFO L226 Difference]: Without dead ends: 2528 [2019-11-07 01:04:58,506 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:04:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-11-07 01:04:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-11-07 01:04:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-11-07 01:04:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-11-07 01:04:58,634 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-11-07 01:04:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:58,634 INFO L462 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-11-07 01:04:58,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-11-07 01:04:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:04:58,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:58,640 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:04:58,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-11-07 01:04:58,641 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:58,641 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864242714] [2019-11-07 01:04:58,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,750 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:04:58,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864242714] [2019-11-07 01:04:58,751 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,751 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:58,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486520713] [2019-11-07 01:04:58,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:58,753 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:58,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:58,754 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-11-07 01:04:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:59,250 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-11-07 01:04:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:59,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:04:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:59,281 INFO L225 Difference]: With dead ends: 6812 [2019-11-07 01:04:59,281 INFO L226 Difference]: Without dead ends: 4696 [2019-11-07 01:04:59,293 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:04:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-11-07 01:04:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-11-07 01:04:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-11-07 01:04:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-11-07 01:04:59,628 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-11-07 01:04:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:59,628 INFO L462 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-11-07 01:04:59,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-11-07 01:04:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:04:59,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:59,638 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:04:59,638 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-11-07 01:04:59,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:59,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582507409] [2019-11-07 01:04:59,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:00,308 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:00,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582507409] [2019-11-07 01:05:00,308 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:00,309 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 01:05:00,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167808393] [2019-11-07 01:05:00,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 01:05:00,309 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:00,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 01:05:00,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:05:00,310 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 15 states. [2019-11-07 01:05:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:02,530 INFO L93 Difference]: Finished difference Result 12388 states and 19102 transitions. [2019-11-07 01:05:02,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:05:02,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2019-11-07 01:05:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:02,588 INFO L225 Difference]: With dead ends: 12388 [2019-11-07 01:05:02,588 INFO L226 Difference]: Without dead ends: 8416 [2019-11-07 01:05:02,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-11-07 01:05:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-11-07 01:05:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 6432. [2019-11-07 01:05:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-11-07 01:05:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9844 transitions. [2019-11-07 01:05:03,107 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9844 transitions. Word has length 158 [2019-11-07 01:05:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:03,108 INFO L462 AbstractCegarLoop]: Abstraction has 6432 states and 9844 transitions. [2019-11-07 01:05:03,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 01:05:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9844 transitions. [2019-11-07 01:05:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:03,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:03,115 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:03,116 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-11-07 01:05:03,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:03,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158631257] [2019-11-07 01:05:03,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:03,385 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:03,386 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158631257] [2019-11-07 01:05:03,386 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:03,386 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:03,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348026215] [2019-11-07 01:05:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:03,387 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:03,388 INFO L87 Difference]: Start difference. First operand 6432 states and 9844 transitions. Second operand 9 states. [2019-11-07 01:05:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:04,050 INFO L93 Difference]: Finished difference Result 13818 states and 21476 transitions. [2019-11-07 01:05:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:04,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-11-07 01:05:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:04,074 INFO L225 Difference]: With dead ends: 13818 [2019-11-07 01:05:04,075 INFO L226 Difference]: Without dead ends: 9628 [2019-11-07 01:05:04,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2019-11-07 01:05:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 7796. [2019-11-07 01:05:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-11-07 01:05:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-11-07 01:05:04,547 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-11-07 01:05:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:04,549 INFO L462 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-11-07 01:05:04,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-11-07 01:05:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:04,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:04,559 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:04,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-11-07 01:05:04,560 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:04,560 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718670983] [2019-11-07 01:05:04,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:04,777 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:04,777 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718670983] [2019-11-07 01:05:04,777 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:04,777 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:04,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113502011] [2019-11-07 01:05:04,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:04,779 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:04,779 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 5 states. [2019-11-07 01:05:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:05,773 INFO L93 Difference]: Finished difference Result 16045 states and 25162 transitions. [2019-11-07 01:05:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:05,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-07 01:05:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:05,806 INFO L225 Difference]: With dead ends: 16045 [2019-11-07 01:05:05,806 INFO L226 Difference]: Without dead ends: 14207 [2019-11-07 01:05:05,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2019-11-07 01:05:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 10541. [2019-11-07 01:05:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2019-11-07 01:05:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 16098 transitions. [2019-11-07 01:05:06,478 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 16098 transitions. Word has length 158 [2019-11-07 01:05:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:06,478 INFO L462 AbstractCegarLoop]: Abstraction has 10541 states and 16098 transitions. [2019-11-07 01:05:06,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 16098 transitions. [2019-11-07 01:05:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:06,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:06,489 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:06,489 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1963094895, now seen corresponding path program 1 times [2019-11-07 01:05:06,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:06,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386152719] [2019-11-07 01:05:06,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:06,674 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:06,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386152719] [2019-11-07 01:05:06,675 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:06,675 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:06,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993763204] [2019-11-07 01:05:06,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:06,676 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:06,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:06,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:06,676 INFO L87 Difference]: Start difference. First operand 10541 states and 16098 transitions. Second operand 4 states. [2019-11-07 01:05:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:07,576 INFO L93 Difference]: Finished difference Result 27660 states and 42237 transitions. [2019-11-07 01:05:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:07,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-07 01:05:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:07,615 INFO L225 Difference]: With dead ends: 27660 [2019-11-07 01:05:07,615 INFO L226 Difference]: Without dead ends: 17128 [2019-11-07 01:05:07,637 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:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-11-07 01:05:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17126. [2019-11-07 01:05:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-11-07 01:05:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 25905 transitions. [2019-11-07 01:05:08,986 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 25905 transitions. Word has length 158 [2019-11-07 01:05:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:08,986 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 25905 transitions. [2019-11-07 01:05:08,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 25905 transitions. [2019-11-07 01:05:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 01:05:08,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:08,999 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] [2019-11-07 01:05:08,999 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1251669041, now seen corresponding path program 1 times [2019-11-07 01:05:09,000 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:09,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187225776] [2019-11-07 01:05:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:09,089 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:09,089 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187225776] [2019-11-07 01:05:09,090 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:09,090 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:09,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897534093] [2019-11-07 01:05:09,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:09,091 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:09,091 INFO L87 Difference]: Start difference. First operand 17126 states and 25905 transitions. Second operand 3 states. [2019-11-07 01:05:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:10,186 INFO L93 Difference]: Finished difference Result 46538 states and 70297 transitions. [2019-11-07 01:05:10,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:10,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-07 01:05:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:10,267 INFO L225 Difference]: With dead ends: 46538 [2019-11-07 01:05:10,267 INFO L226 Difference]: Without dead ends: 29773 [2019-11-07 01:05:10,296 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:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29773 states. [2019-11-07 01:05:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 29771. [2019-11-07 01:05:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29771 states. [2019-11-07 01:05:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29771 states to 29771 states and 44403 transitions. [2019-11-07 01:05:11,805 INFO L78 Accepts]: Start accepts. Automaton has 29771 states and 44403 transitions. Word has length 160 [2019-11-07 01:05:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:11,805 INFO L462 AbstractCegarLoop]: Abstraction has 29771 states and 44403 transitions. [2019-11-07 01:05:11,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29771 states and 44403 transitions. [2019-11-07 01:05:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 01:05:11,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:11,826 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] [2019-11-07 01:05:11,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -488936532, now seen corresponding path program 1 times [2019-11-07 01:05:11,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:11,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056507054] [2019-11-07 01:05:11,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:11,951 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056507054] [2019-11-07 01:05:11,951 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:11,951 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:11,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388865827] [2019-11-07 01:05:11,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:11,952 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:11,954 INFO L87 Difference]: Start difference. First operand 29771 states and 44403 transitions. Second operand 4 states. [2019-11-07 01:05:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:13,873 INFO L93 Difference]: Finished difference Result 49776 states and 74234 transitions. [2019-11-07 01:05:13,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:13,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-07 01:05:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:13,921 INFO L225 Difference]: With dead ends: 49776 [2019-11-07 01:05:13,922 INFO L226 Difference]: Without dead ends: 26850 [2019-11-07 01:05:13,952 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:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26850 states. [2019-11-07 01:05:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26850 to 26850. [2019-11-07 01:05:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-11-07 01:05:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 40034 transitions. [2019-11-07 01:05:15,149 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 40034 transitions. Word has length 160 [2019-11-07 01:05:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:15,149 INFO L462 AbstractCegarLoop]: Abstraction has 26850 states and 40034 transitions. [2019-11-07 01:05:15,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 40034 transitions. [2019-11-07 01:05:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:05:15,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:15,167 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, 1] [2019-11-07 01:05:15,167 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1120267668, now seen corresponding path program 1 times [2019-11-07 01:05:15,168 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:15,168 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116450745] [2019-11-07 01:05:15,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:15,279 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:15,279 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116450745] [2019-11-07 01:05:15,279 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:15,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:15,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404440040] [2019-11-07 01:05:15,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:15,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:15,281 INFO L87 Difference]: Start difference. First operand 26850 states and 40034 transitions. Second operand 3 states. [2019-11-07 01:05:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:16,933 INFO L93 Difference]: Finished difference Result 51482 states and 79000 transitions. [2019-11-07 01:05:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:16,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-07 01:05:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:16,978 INFO L225 Difference]: With dead ends: 51482 [2019-11-07 01:05:16,978 INFO L226 Difference]: Without dead ends: 35028 [2019-11-07 01:05:16,997 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,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2019-11-07 01:05:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 32518. [2019-11-07 01:05:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32518 states. [2019-11-07 01:05:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32518 states to 32518 states and 48470 transitions. [2019-11-07 01:05:19,297 INFO L78 Accepts]: Start accepts. Automaton has 32518 states and 48470 transitions. Word has length 166 [2019-11-07 01:05:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,297 INFO L462 AbstractCegarLoop]: Abstraction has 32518 states and 48470 transitions. [2019-11-07 01:05:19,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32518 states and 48470 transitions. [2019-11-07 01:05:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:05:19,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,309 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, 1] [2019-11-07 01:05:19,309 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1417380321, now seen corresponding path program 1 times [2019-11-07 01:05:19,310 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,310 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084179754] [2019-11-07 01:05:19,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,487 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,487 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084179754] [2019-11-07 01:05:19,488 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,488 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:19,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909905470] [2019-11-07 01:05:19,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:19,489 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:19,490 INFO L87 Difference]: Start difference. First operand 32518 states and 48470 transitions. Second operand 5 states. [2019-11-07 01:05:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:22,165 INFO L93 Difference]: Finished difference Result 74926 states and 115502 transitions. [2019-11-07 01:05:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:22,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-11-07 01:05:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:22,252 INFO L225 Difference]: With dead ends: 74926 [2019-11-07 01:05:22,253 INFO L226 Difference]: Without dead ends: 57596 [2019-11-07 01:05:22,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57596 states. [2019-11-07 01:05:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57596 to 34850. [2019-11-07 01:05:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34850 states. [2019-11-07 01:05:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34850 states to 34850 states and 52226 transitions. [2019-11-07 01:05:24,152 INFO L78 Accepts]: Start accepts. Automaton has 34850 states and 52226 transitions. Word has length 166 [2019-11-07 01:05:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:24,152 INFO L462 AbstractCegarLoop]: Abstraction has 34850 states and 52226 transitions. [2019-11-07 01:05:24,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 34850 states and 52226 transitions. [2019-11-07 01:05:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:05:24,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:24,164 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, 1] [2019-11-07 01:05:24,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1681876025, now seen corresponding path program 1 times [2019-11-07 01:05:24,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:24,165 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507907689] [2019-11-07 01:05:24,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:24,382 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:24,387 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507907689] [2019-11-07 01:05:24,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:24,389 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:24,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501322921] [2019-11-07 01:05:24,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:24,390 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:24,391 INFO L87 Difference]: Start difference. First operand 34850 states and 52226 transitions. Second operand 8 states.