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-f4eb214f-m [2019-10-13 21:23:44,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:44,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:44,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:44,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:44,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:44,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:44,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:44,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:44,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:44,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:44,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:44,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:44,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:44,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:44,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:44,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:44,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:44,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:44,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:44,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:44,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:44,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:44,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:44,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:44,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:44,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:44,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:44,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:44,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:44,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:44,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:44,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:44,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:44,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:44,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:44,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:44,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:44,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:44,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:44,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:44,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:23:44,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:44,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:44,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:44,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:44,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:44,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:44,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:44,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:44,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:44,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:44,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:44,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:44,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:44,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:44,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:44,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:44,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:44,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:44,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:44,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:44,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:44,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:44,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:44,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:23:45,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:45,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:45,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:45,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:45,121 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:45,122 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-10-13 21:23:45,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848329f7e/6eab9f8aab784eccaaf4bae5b1472bb7/FLAG878c1a9be [2019-10-13 21:23:45,754 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:45,755 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-10-13 21:23:45,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848329f7e/6eab9f8aab784eccaaf4bae5b1472bb7/FLAG878c1a9be [2019-10-13 21:23:46,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848329f7e/6eab9f8aab784eccaaf4bae5b1472bb7 [2019-10-13 21:23:46,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:46,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:46,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:46,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:46,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:46,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167c183f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46, skipping insertion in model container [2019-10-13 21:23:46,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:46,135 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:46,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:46,701 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:46,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:46,908 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:46,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46 WrapperNode [2019-10-13 21:23:46,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:46,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:46,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:46,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:46,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:46,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:47,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... [2019-10-13 21:23:47,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:47,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:47,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:47,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:47,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:47,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:48,650 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:48,651 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:48,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:48 BoogieIcfgContainer [2019-10-13 21:23:48,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:48,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:48,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:48,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:48,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:46" (1/3) ... [2019-10-13 21:23:48,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:48, skipping insertion in model container [2019-10-13 21:23:48,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:46" (2/3) ... [2019-10-13 21:23:48,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:48, skipping insertion in model container [2019-10-13 21:23:48,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:48" (3/3) ... [2019-10-13 21:23:48,661 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:48,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:48,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:48,693 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:48,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:48,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:48,724 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:48,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:48,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:48,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:48,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:48,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-10-13 21:23:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:48,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:48,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:48,772 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-10-13 21:23:48,787 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:48,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291052482] [2019-10-13 21:23:48,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:49,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291052482] [2019-10-13 21:23:49,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:49,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:49,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886990178] [2019-10-13 21:23:49,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:49,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:49,474 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-10-13 21:23:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:49,742 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-10-13 21:23:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:49,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:23:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:49,764 INFO L225 Difference]: With dead ends: 641 [2019-10-13 21:23:49,764 INFO L226 Difference]: Without dead ends: 514 [2019-10-13 21:23:49,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-13 21:23:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-13 21:23:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-13 21:23:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-10-13 21:23:49,862 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-10-13 21:23:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:49,863 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-10-13 21:23:49,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-10-13 21:23:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:49,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:49,869 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:49,869 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-10-13 21:23:49,870 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:49,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261249804] [2019-10-13 21:23:49,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:50,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261249804] [2019-10-13 21:23:50,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:50,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:50,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744765332] [2019-10-13 21:23:50,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:50,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:50,143 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-10-13 21:23:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:50,287 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-10-13 21:23:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:50,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:23:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:50,295 INFO L225 Difference]: With dead ends: 1076 [2019-10-13 21:23:50,296 INFO L226 Difference]: Without dead ends: 884 [2019-10-13 21:23:50,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-13 21:23:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-10-13 21:23:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-10-13 21:23:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-10-13 21:23:50,356 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-10-13 21:23:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:50,357 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-10-13 21:23:50,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-10-13 21:23:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:50,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:50,362 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:50,362 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-10-13 21:23:50,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:50,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284530026] [2019-10-13 21:23:50,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:50,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:50,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:50,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284530026] [2019-10-13 21:23:50,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:50,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:50,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004474409] [2019-10-13 21:23:50,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:50,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:50,739 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-10-13 21:23:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:50,925 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-10-13 21:23:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:50,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:23:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:50,940 INFO L225 Difference]: With dead ends: 2577 [2019-10-13 21:23:50,940 INFO L226 Difference]: Without dead ends: 1708 [2019-10-13 21:23:50,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-10-13 21:23:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-10-13 21:23:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-10-13 21:23:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-10-13 21:23:51,062 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-10-13 21:23:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:51,063 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-10-13 21:23:51,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-10-13 21:23:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:23:51,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:51,070 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:51,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-10-13 21:23:51,071 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:51,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951258421] [2019-10-13 21:23:51,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:51,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951258421] [2019-10-13 21:23:51,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:51,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:51,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398542948] [2019-10-13 21:23:51,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:51,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:51,234 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-10-13 21:23:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:51,443 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-10-13 21:23:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:51,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-13 21:23:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:51,464 INFO L225 Difference]: With dead ends: 5072 [2019-10-13 21:23:51,464 INFO L226 Difference]: Without dead ends: 3398 [2019-10-13 21:23:51,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-13 21:23:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-10-13 21:23:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-10-13 21:23:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-10-13 21:23:51,598 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-10-13 21:23:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:51,598 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-10-13 21:23:51,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-10-13 21:23:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:51,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:51,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:51,603 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-10-13 21:23:51,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:51,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355566770] [2019-10-13 21:23:51,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:51,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355566770] [2019-10-13 21:23:51,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:51,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:51,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492024579] [2019-10-13 21:23:51,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:51,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:51,738 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-10-13 21:23:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:52,011 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-10-13 21:23:52,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:52,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 21:23:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:52,029 INFO L225 Difference]: With dead ends: 4838 [2019-10-13 21:23:52,029 INFO L226 Difference]: Without dead ends: 3310 [2019-10-13 21:23:52,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-10-13 21:23:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-10-13 21:23:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-10-13 21:23:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-10-13 21:23:52,261 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-10-13 21:23:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:52,262 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-10-13 21:23:52,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-10-13 21:23:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:52,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:52,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:52,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-10-13 21:23:52,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:52,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118584349] [2019-10-13 21:23:52,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:52,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118584349] [2019-10-13 21:23:52,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:52,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:52,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229007254] [2019-10-13 21:23:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:52,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:52,524 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-10-13 21:23:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:52,759 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-10-13 21:23:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:52,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:23:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:52,780 INFO L225 Difference]: With dead ends: 5666 [2019-10-13 21:23:52,781 INFO L226 Difference]: Without dead ends: 2528 [2019-10-13 21:23:52,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-10-13 21:23:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-10-13 21:23:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-10-13 21:23:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-10-13 21:23:52,976 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-10-13 21:23:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:52,976 INFO L462 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-10-13 21:23:52,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-10-13 21:23:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:52,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:52,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:52,982 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-10-13 21:23:52,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:52,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061071799] [2019-10-13 21:23:52,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061071799] [2019-10-13 21:23:53,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967282286] [2019-10-13 21:23:53,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,108 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-10-13 21:23:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:53,736 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-10-13 21:23:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:53,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:23:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:53,760 INFO L225 Difference]: With dead ends: 6812 [2019-10-13 21:23:53,761 INFO L226 Difference]: Without dead ends: 4696 [2019-10-13 21:23:53,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-10-13 21:23:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-10-13 21:23:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-10-13 21:23:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-10-13 21:23:54,025 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-10-13 21:23:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:54,026 INFO L462 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-10-13 21:23:54,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-10-13 21:23:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:54,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:54,037 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:54,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-10-13 21:23:54,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:54,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307346869] [2019-10-13 21:23:54,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:54,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307346869] [2019-10-13 21:23:54,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 21:23:54,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244431447] [2019-10-13 21:23:54,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:23:54,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:23:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:23:54,630 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 15 states. [2019-10-13 21:23:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,143 INFO L93 Difference]: Finished difference Result 12388 states and 19102 transitions. [2019-10-13 21:23:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:23:57,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2019-10-13 21:23:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,211 INFO L225 Difference]: With dead ends: 12388 [2019-10-13 21:23:57,211 INFO L226 Difference]: Without dead ends: 8416 [2019-10-13 21:23:57,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:23:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-10-13 21:23:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 6432. [2019-10-13 21:23:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-10-13 21:23:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9844 transitions. [2019-10-13 21:23:57,676 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9844 transitions. Word has length 158 [2019-10-13 21:23:57,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,677 INFO L462 AbstractCegarLoop]: Abstraction has 6432 states and 9844 transitions. [2019-10-13 21:23:57,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:23:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9844 transitions. [2019-10-13 21:23:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:57,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:57,688 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-10-13 21:23:57,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722840249] [2019-10-13 21:23:57,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:57,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722840249] [2019-10-13 21:23:57,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:23:57,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961561920] [2019-10-13 21:23:57,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:23:57,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:23:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:57,995 INFO L87 Difference]: Start difference. First operand 6432 states and 9844 transitions. Second operand 9 states. [2019-10-13 21:23:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,723 INFO L93 Difference]: Finished difference Result 13818 states and 21476 transitions. [2019-10-13 21:23:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:58,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-13 21:23:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,745 INFO L225 Difference]: With dead ends: 13818 [2019-10-13 21:23:58,745 INFO L226 Difference]: Without dead ends: 9628 [2019-10-13 21:23:58,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2019-10-13 21:23:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 7796. [2019-10-13 21:23:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-10-13 21:23:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-10-13 21:23:59,134 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-10-13 21:23:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,136 INFO L462 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-10-13 21:23:59,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:23:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-10-13 21:23:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:59,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:59,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-10-13 21:23:59,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370430809] [2019-10-13 21:23:59,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:59,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370430809] [2019-10-13 21:23:59,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:23:59,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318582436] [2019-10-13 21:23:59,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:59,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:59,399 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 5 states. [2019-10-13 21:24:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,371 INFO L93 Difference]: Finished difference Result 16045 states and 25162 transitions. [2019-10-13 21:24:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:00,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-13 21:24:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,406 INFO L225 Difference]: With dead ends: 16045 [2019-10-13 21:24:00,406 INFO L226 Difference]: Without dead ends: 14207 [2019-10-13 21:24:00,416 INFO L600 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-10-13 21:24:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2019-10-13 21:24:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 10541. [2019-10-13 21:24:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2019-10-13 21:24:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 16098 transitions. [2019-10-13 21:24:01,154 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 16098 transitions. Word has length 158 [2019-10-13 21:24:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:01,155 INFO L462 AbstractCegarLoop]: Abstraction has 10541 states and 16098 transitions. [2019-10-13 21:24:01,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 16098 transitions. [2019-10-13 21:24:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:01,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:01,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:01,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1963094895, now seen corresponding path program 1 times [2019-10-13 21:24:01,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:01,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699211601] [2019-10-13 21:24:01,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:01,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:01,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699211601] [2019-10-13 21:24:01,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:01,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:01,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353388145] [2019-10-13 21:24:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:01,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:01,394 INFO L87 Difference]: Start difference. First operand 10541 states and 16098 transitions. Second operand 4 states. [2019-10-13 21:24:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,826 INFO L93 Difference]: Finished difference Result 27660 states and 42237 transitions. [2019-10-13 21:24:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:02,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-13 21:24:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,874 INFO L225 Difference]: With dead ends: 27660 [2019-10-13 21:24:02,875 INFO L226 Difference]: Without dead ends: 17128 [2019-10-13 21:24:02,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-10-13 21:24:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17126. [2019-10-13 21:24:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-10-13 21:24:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 25905 transitions. [2019-10-13 21:24:04,430 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 25905 transitions. Word has length 158 [2019-10-13 21:24:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:04,431 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 25905 transitions. [2019-10-13 21:24:04,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 25905 transitions. [2019-10-13 21:24:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:24:04,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:04,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:04,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1251669041, now seen corresponding path program 1 times [2019-10-13 21:24:04,446 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:04,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145815081] [2019-10-13 21:24:04,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:04,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145815081] [2019-10-13 21:24:04,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:04,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:04,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828225300] [2019-10-13 21:24:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:04,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:04,544 INFO L87 Difference]: Start difference. First operand 17126 states and 25905 transitions. Second operand 3 states. [2019-10-13 21:24:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,907 INFO L93 Difference]: Finished difference Result 46538 states and 70297 transitions. [2019-10-13 21:24:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:05,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-13 21:24:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,968 INFO L225 Difference]: With dead ends: 46538 [2019-10-13 21:24:05,968 INFO L226 Difference]: Without dead ends: 29773 [2019-10-13 21:24:06,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29773 states. [2019-10-13 21:24:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 29771. [2019-10-13 21:24:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29771 states. [2019-10-13 21:24:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29771 states to 29771 states and 44403 transitions. [2019-10-13 21:24:07,492 INFO L78 Accepts]: Start accepts. Automaton has 29771 states and 44403 transitions. Word has length 160 [2019-10-13 21:24:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:07,492 INFO L462 AbstractCegarLoop]: Abstraction has 29771 states and 44403 transitions. [2019-10-13 21:24:07,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29771 states and 44403 transitions. [2019-10-13 21:24:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:24:07,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:07,514 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:07,514 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -488936532, now seen corresponding path program 1 times [2019-10-13 21:24:07,515 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:07,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140383708] [2019-10-13 21:24:07,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:07,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140383708] [2019-10-13 21:24:07,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:07,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126279349] [2019-10-13 21:24:07,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:07,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:07,660 INFO L87 Difference]: Start difference. First operand 29771 states and 44403 transitions. Second operand 4 states. [2019-10-13 21:24:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:09,436 INFO L93 Difference]: Finished difference Result 49776 states and 74234 transitions. [2019-10-13 21:24:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:09,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-13 21:24:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:09,479 INFO L225 Difference]: With dead ends: 49776 [2019-10-13 21:24:09,479 INFO L226 Difference]: Without dead ends: 26850 [2019-10-13 21:24:09,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26850 states. [2019-10-13 21:24:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26850 to 26850. [2019-10-13 21:24:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-10-13 21:24:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 40034 transitions. [2019-10-13 21:24:10,703 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 40034 transitions. Word has length 160 [2019-10-13 21:24:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 26850 states and 40034 transitions. [2019-10-13 21:24:10,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 40034 transitions. [2019-10-13 21:24:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:10,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:10,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:10,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:10,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1120267668, now seen corresponding path program 1 times [2019-10-13 21:24:10,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:10,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469316223] [2019-10-13 21:24:10,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:10,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469316223] [2019-10-13 21:24:10,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:10,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:10,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882526542] [2019-10-13 21:24:10,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:10,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:10,837 INFO L87 Difference]: Start difference. First operand 26850 states and 40034 transitions. Second operand 3 states. [2019-10-13 21:24:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:12,477 INFO L93 Difference]: Finished difference Result 51482 states and 79000 transitions. [2019-10-13 21:24:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:12,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-13 21:24:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:12,523 INFO L225 Difference]: With dead ends: 51482 [2019-10-13 21:24:12,523 INFO L226 Difference]: Without dead ends: 35028 [2019-10-13 21:24:12,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2019-10-13 21:24:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 32518. [2019-10-13 21:24:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32518 states. [2019-10-13 21:24:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32518 states to 32518 states and 48470 transitions. [2019-10-13 21:24:14,132 INFO L78 Accepts]: Start accepts. Automaton has 32518 states and 48470 transitions. Word has length 166 [2019-10-13 21:24:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:14,133 INFO L462 AbstractCegarLoop]: Abstraction has 32518 states and 48470 transitions. [2019-10-13 21:24:14,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32518 states and 48470 transitions. [2019-10-13 21:24:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:14,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:14,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:14,147 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1417380321, now seen corresponding path program 1 times [2019-10-13 21:24:14,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:14,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919687804] [2019-10-13 21:24:14,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:14,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919687804] [2019-10-13 21:24:14,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:14,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:14,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643283570] [2019-10-13 21:24:14,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:14,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:14,326 INFO L87 Difference]: Start difference. First operand 32518 states and 48470 transitions. Second operand 5 states. [2019-10-13 21:24:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,663 INFO L93 Difference]: Finished difference Result 74926 states and 115502 transitions. [2019-10-13 21:24:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:17,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-10-13 21:24:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:17,738 INFO L225 Difference]: With dead ends: 74926 [2019-10-13 21:24:17,738 INFO L226 Difference]: Without dead ends: 57596 [2019-10-13 21:24:17,763 INFO L600 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-10-13 21:24:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57596 states.