/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:59,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:59,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:59,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:59,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:59,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:59,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:59,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:59,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:59,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:59,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:59,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:59,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:59,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:59,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:59,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:59,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:59,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:59,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:59,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:59,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:59,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:59,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:59,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:59,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:59,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:59,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:59,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:59,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:59,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:59,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:59,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:59,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:59,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:59,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:59,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:59,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:59,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:59,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:59,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:59,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:59,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:06:59,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:59,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:59,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:59,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:59,873 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:59,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:59,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:59,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:59,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:59,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:59,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:59,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:59,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:59,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:59,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:59,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:59,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:59,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:59,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:59,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:59,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:59,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:59,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:59,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:59,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:59,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:59,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:59,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:59,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:07:00,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:07:00,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:07:00,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:07:00,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:07:00,181 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:07:00,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:07:00,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7afd38a/e393dfaf695444e6a5fe548a1d2254ff/FLAG762f947c4 [2019-11-07 01:07:00,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:00,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:07:00,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7afd38a/e393dfaf695444e6a5fe548a1d2254ff/FLAG762f947c4 [2019-11-07 01:07:01,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7afd38a/e393dfaf695444e6a5fe548a1d2254ff [2019-11-07 01:07:01,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:01,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:01,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:01,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:01,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:01,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:01,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429c2f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01, skipping insertion in model container [2019-11-07 01:07:01,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:01,110 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:01,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:01,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:01,798 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:01,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:01,988 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:01,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01 WrapperNode [2019-11-07 01:07:01,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:01,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:01,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:01,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:02,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:02,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:02,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:02,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:02,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:07:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:07:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:07:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:03,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:03,826 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:07:03,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:03 BoogieIcfgContainer [2019-11-07 01:07:03,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:03,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:03,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:03,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:01" (1/3) ... [2019-11-07 01:07:03,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545730cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:03, skipping insertion in model container [2019-11-07 01:07:03,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (2/3) ... [2019-11-07 01:07:03,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545730cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:03, skipping insertion in model container [2019-11-07 01:07:03,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:03" (3/3) ... [2019-11-07 01:07:03,835 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 01:07:03,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:03,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:07:03,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:07:03,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:03,936 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:03,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:03,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:03,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:03,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:03,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:03,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-11-07 01:07:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:07:03,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:04,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:04,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1155837260, now seen corresponding path program 1 times [2019-11-07 01:07:04,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:04,022 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624392307] [2019-11-07 01:07:04,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:04,772 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624392307] [2019-11-07 01:07:04,773 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:04,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:04,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712880286] [2019-11-07 01:07:04,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:04,783 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:04,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:04,801 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-11-07 01:07:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:05,023 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2019-11-07 01:07:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:05,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:07:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:05,047 INFO L225 Difference]: With dead ends: 647 [2019-11-07 01:07:05,048 INFO L226 Difference]: Without dead ends: 527 [2019-11-07 01:07:05,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-11-07 01:07:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-11-07 01:07:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-07 01:07:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 780 transitions. [2019-11-07 01:07:05,158 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 780 transitions. Word has length 156 [2019-11-07 01:07:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,159 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 780 transitions. [2019-11-07 01:07:05,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 780 transitions. [2019-11-07 01:07:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:07:05,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:05,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:05,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1353690447, now seen corresponding path program 1 times [2019-11-07 01:07:05,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:05,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568171546] [2019-11-07 01:07:05,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:05,549 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568171546] [2019-11-07 01:07:05,549 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:05,549 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:05,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511266938] [2019-11-07 01:07:05,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:05,552 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:05,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:05,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:05,553 INFO L87 Difference]: Start difference. First operand 525 states and 780 transitions. Second operand 4 states. [2019-11-07 01:07:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:05,692 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2019-11-07 01:07:05,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:05,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-07 01:07:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:05,699 INFO L225 Difference]: With dead ends: 1532 [2019-11-07 01:07:05,700 INFO L226 Difference]: Without dead ends: 1020 [2019-11-07 01:07:05,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-11-07 01:07:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1018. [2019-11-07 01:07:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-11-07 01:07:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1501 transitions. [2019-11-07 01:07:05,783 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1501 transitions. Word has length 156 [2019-11-07 01:07:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,785 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 1501 transitions. [2019-11-07 01:07:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1501 transitions. [2019-11-07 01:07:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:05,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:05,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:05,796 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1552789903, now seen corresponding path program 1 times [2019-11-07 01:07:05,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:05,799 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356389648] [2019-11-07 01:07:05,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:05,958 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356389648] [2019-11-07 01:07:05,958 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:05,958 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:05,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526252564] [2019-11-07 01:07:05,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:05,960 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:05,960 INFO L87 Difference]: Start difference. First operand 1018 states and 1501 transitions. Second operand 3 states. [2019-11-07 01:07:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:06,043 INFO L93 Difference]: Finished difference Result 3008 states and 4433 transitions. [2019-11-07 01:07:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:06,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-07 01:07:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,054 INFO L225 Difference]: With dead ends: 3008 [2019-11-07 01:07:06,055 INFO L226 Difference]: Without dead ends: 2022 [2019-11-07 01:07:06,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-11-07 01:07:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1020. [2019-11-07 01:07:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-07 01:07:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1503 transitions. [2019-11-07 01:07:06,117 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1503 transitions. Word has length 157 [2019-11-07 01:07:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:06,118 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1503 transitions. [2019-11-07 01:07:06,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1503 transitions. [2019-11-07 01:07:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:07:06,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:06,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:06,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1516867775, now seen corresponding path program 1 times [2019-11-07 01:07:06,122 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:06,123 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231375875] [2019-11-07 01:07:06,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:06,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231375875] [2019-11-07 01:07:06,250 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:06,251 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:06,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397076767] [2019-11-07 01:07:06,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:06,252 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:06,252 INFO L87 Difference]: Start difference. First operand 1020 states and 1503 transitions. Second operand 3 states. [2019-11-07 01:07:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:06,403 INFO L93 Difference]: Finished difference Result 2789 states and 4120 transitions. [2019-11-07 01:07:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:06,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:07:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,417 INFO L225 Difference]: With dead ends: 2789 [2019-11-07 01:07:06,418 INFO L226 Difference]: Without dead ends: 1966 [2019-11-07 01:07:06,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-11-07 01:07:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1964. [2019-11-07 01:07:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-07 01:07:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2867 transitions. [2019-11-07 01:07:06,597 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2867 transitions. Word has length 158 [2019-11-07 01:07:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:06,598 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 2867 transitions. [2019-11-07 01:07:06,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2867 transitions. [2019-11-07 01:07:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:07:06,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:06,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:06,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2015367012, now seen corresponding path program 1 times [2019-11-07 01:07:06,607 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:06,607 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920906606] [2019-11-07 01:07:06,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:06,935 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920906606] [2019-11-07 01:07:06,936 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:06,936 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:06,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18595942] [2019-11-07 01:07:06,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:06,937 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:06,939 INFO L87 Difference]: Start difference. First operand 1964 states and 2867 transitions. Second operand 4 states. [2019-11-07 01:07:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:07,059 INFO L93 Difference]: Finished difference Result 3278 states and 4800 transitions. [2019-11-07 01:07:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:07,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-07 01:07:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:07,069 INFO L225 Difference]: With dead ends: 3278 [2019-11-07 01:07:07,069 INFO L226 Difference]: Without dead ends: 1499 [2019-11-07 01:07:07,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-11-07 01:07:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2019-11-07 01:07:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-11-07 01:07:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2182 transitions. [2019-11-07 01:07:07,159 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2182 transitions. Word has length 158 [2019-11-07 01:07:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:07,160 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 2182 transitions. [2019-11-07 01:07:07,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2182 transitions. [2019-11-07 01:07:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:07:07,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:07,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:07,164 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -528962491, now seen corresponding path program 1 times [2019-11-07 01:07:07,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:07,165 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584804554] [2019-11-07 01:07:07,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:07,266 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584804554] [2019-11-07 01:07:07,267 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:07,267 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:07,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507249539] [2019-11-07 01:07:07,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:07,268 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:07,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:07,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:07,269 INFO L87 Difference]: Start difference. First operand 1499 states and 2182 transitions. Second operand 3 states. [2019-11-07 01:07:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:07,430 INFO L93 Difference]: Finished difference Result 3290 states and 4921 transitions. [2019-11-07 01:07:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:07,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-07 01:07:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:07,441 INFO L225 Difference]: With dead ends: 3290 [2019-11-07 01:07:07,441 INFO L226 Difference]: Without dead ends: 1977 [2019-11-07 01:07:07,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-11-07 01:07:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1933. [2019-11-07 01:07:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-11-07 01:07:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2888 transitions. [2019-11-07 01:07:07,615 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2888 transitions. Word has length 159 [2019-11-07 01:07:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:07,615 INFO L462 AbstractCegarLoop]: Abstraction has 1933 states and 2888 transitions. [2019-11-07 01:07:07,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2888 transitions. [2019-11-07 01:07:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:07:07,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:07,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:07,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1484207381, now seen corresponding path program 1 times [2019-11-07 01:07:07,621 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:07,621 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870321028] [2019-11-07 01:07:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:07,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870321028] [2019-11-07 01:07:07,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:07,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:07,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626215524] [2019-11-07 01:07:07,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:07,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:07,730 INFO L87 Difference]: Start difference. First operand 1933 states and 2888 transitions. Second operand 3 states. [2019-11-07 01:07:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:07,958 INFO L93 Difference]: Finished difference Result 4690 states and 7155 transitions. [2019-11-07 01:07:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:07,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-07 01:07:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:07,978 INFO L225 Difference]: With dead ends: 4690 [2019-11-07 01:07:07,978 INFO L226 Difference]: Without dead ends: 3027 [2019-11-07 01:07:07,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2019-11-07 01:07:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2711. [2019-11-07 01:07:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-11-07 01:07:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4151 transitions. [2019-11-07 01:07:08,168 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4151 transitions. Word has length 162 [2019-11-07 01:07:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:08,168 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 4151 transitions. [2019-11-07 01:07:08,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4151 transitions. [2019-11-07 01:07:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:07:08,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:08,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:08,173 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2071220188, now seen corresponding path program 1 times [2019-11-07 01:07:08,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:08,174 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606727543] [2019-11-07 01:07:08,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:08,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606727543] [2019-11-07 01:07:08,535 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:08,535 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:08,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652582708] [2019-11-07 01:07:08,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:08,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:08,537 INFO L87 Difference]: Start difference. First operand 2711 states and 4151 transitions. Second operand 9 states. [2019-11-07 01:07:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:09,722 INFO L93 Difference]: Finished difference Result 9554 states and 14922 transitions. [2019-11-07 01:07:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:07:09,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-11-07 01:07:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:09,762 INFO L225 Difference]: With dead ends: 9554 [2019-11-07 01:07:09,762 INFO L226 Difference]: Without dead ends: 7023 [2019-11-07 01:07:09,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2019-11-07 01:07:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 5089. [2019-11-07 01:07:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-11-07 01:07:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7829 transitions. [2019-11-07 01:07:10,287 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7829 transitions. Word has length 162 [2019-11-07 01:07:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:10,288 INFO L462 AbstractCegarLoop]: Abstraction has 5089 states and 7829 transitions. [2019-11-07 01:07:10,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7829 transitions. [2019-11-07 01:07:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:07:10,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:10,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:10,294 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 430958199, now seen corresponding path program 1 times [2019-11-07 01:07:10,295 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:10,295 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058383216] [2019-11-07 01:07:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:10,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058383216] [2019-11-07 01:07:10,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:10,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:10,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557383673] [2019-11-07 01:07:10,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:10,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:10,471 INFO L87 Difference]: Start difference. First operand 5089 states and 7829 transitions. Second operand 4 states. [2019-11-07 01:07:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:11,122 INFO L93 Difference]: Finished difference Result 13547 states and 21235 transitions. [2019-11-07 01:07:11,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:11,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-07 01:07:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:11,164 INFO L225 Difference]: With dead ends: 13547 [2019-11-07 01:07:11,164 INFO L226 Difference]: Without dead ends: 9797 [2019-11-07 01:07:11,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2019-11-07 01:07:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 9795. [2019-11-07 01:07:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-11-07 01:07:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 15103 transitions. [2019-11-07 01:07:11,854 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 15103 transitions. Word has length 162 [2019-11-07 01:07:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:11,855 INFO L462 AbstractCegarLoop]: Abstraction has 9795 states and 15103 transitions. [2019-11-07 01:07:11,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 15103 transitions. [2019-11-07 01:07:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:07:11,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:11,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:11,863 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash 169281566, now seen corresponding path program 1 times [2019-11-07 01:07:11,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:11,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344087910] [2019-11-07 01:07:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:12,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344087910] [2019-11-07 01:07:12,122 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:12,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:12,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872332394] [2019-11-07 01:07:12,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:12,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:12,124 INFO L87 Difference]: Start difference. First operand 9795 states and 15103 transitions. Second operand 4 states. [2019-11-07 01:07:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:13,070 INFO L93 Difference]: Finished difference Result 25746 states and 39693 transitions. [2019-11-07 01:07:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:13,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-07 01:07:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:13,106 INFO L225 Difference]: With dead ends: 25746 [2019-11-07 01:07:13,106 INFO L226 Difference]: Without dead ends: 15974 [2019-11-07 01:07:13,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-11-07 01:07:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 15972. [2019-11-07 01:07:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15972 states. [2019-11-07 01:07:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15972 states to 15972 states and 24436 transitions. [2019-11-07 01:07:14,639 INFO L78 Accepts]: Start accepts. Automaton has 15972 states and 24436 transitions. Word has length 162 [2019-11-07 01:07:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:14,640 INFO L462 AbstractCegarLoop]: Abstraction has 15972 states and 24436 transitions. [2019-11-07 01:07:14,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15972 states and 24436 transitions. [2019-11-07 01:07:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 01:07:14,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:14,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:14,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1075293888, now seen corresponding path program 1 times [2019-11-07 01:07:14,652 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:14,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019411528] [2019-11-07 01:07:14,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:14,760 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019411528] [2019-11-07 01:07:14,760 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:14,761 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:14,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087235364] [2019-11-07 01:07:14,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:14,761 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:14,762 INFO L87 Difference]: Start difference. First operand 15972 states and 24436 transitions. Second operand 3 states. [2019-11-07 01:07:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:16,122 INFO L93 Difference]: Finished difference Result 43438 states and 66412 transitions. [2019-11-07 01:07:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:16,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-07 01:07:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:16,190 INFO L225 Difference]: With dead ends: 43438 [2019-11-07 01:07:16,190 INFO L226 Difference]: Without dead ends: 27862 [2019-11-07 01:07:16,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2019-11-07 01:07:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 27860. [2019-11-07 01:07:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-11-07 01:07:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 42130 transitions. [2019-11-07 01:07:17,442 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 42130 transitions. Word has length 164 [2019-11-07 01:07:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:17,443 INFO L462 AbstractCegarLoop]: Abstraction has 27860 states and 42130 transitions. [2019-11-07 01:07:17,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 42130 transitions. [2019-11-07 01:07:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 01:07:17,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:17,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:17,458 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1992197475, now seen corresponding path program 1 times [2019-11-07 01:07:17,458 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:17,459 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114063783] [2019-11-07 01:07:17,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:17,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114063783] [2019-11-07 01:07:17,603 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:17,604 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:17,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274226361] [2019-11-07 01:07:17,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:17,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:17,605 INFO L87 Difference]: Start difference. First operand 27860 states and 42130 transitions. Second operand 4 states. [2019-11-07 01:07:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:18,741 INFO L93 Difference]: Finished difference Result 46369 states and 70138 transitions. [2019-11-07 01:07:18,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:18,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-07 01:07:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:18,804 INFO L225 Difference]: With dead ends: 46369 [2019-11-07 01:07:18,804 INFO L226 Difference]: Without dead ends: 24890 [2019-11-07 01:07:18,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-11-07 01:07:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 24890. [2019-11-07 01:07:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-11-07 01:07:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 37611 transitions. [2019-11-07 01:07:20,623 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 37611 transitions. Word has length 164 [2019-11-07 01:07:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:20,623 INFO L462 AbstractCegarLoop]: Abstraction has 24890 states and 37611 transitions. [2019-11-07 01:07:20,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 37611 transitions. [2019-11-07 01:07:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:07:20,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:20,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:20,636 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash 914961264, now seen corresponding path program 1 times [2019-11-07 01:07:20,637 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:20,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675103654] [2019-11-07 01:07:20,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:20,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675103654] [2019-11-07 01:07:20,729 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:20,729 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:20,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467533357] [2019-11-07 01:07:20,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:20,730 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:20,731 INFO L87 Difference]: Start difference. First operand 24890 states and 37611 transitions. Second operand 3 states. [2019-11-07 01:07:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:22,311 INFO L93 Difference]: Finished difference Result 67686 states and 103354 transitions. [2019-11-07 01:07:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:22,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-07 01:07:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:22,390 INFO L225 Difference]: With dead ends: 67686 [2019-11-07 01:07:22,391 INFO L226 Difference]: Without dead ends: 43132 [2019-11-07 01:07:22,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43132 states. [2019-11-07 01:07:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43132 to 38738. [2019-11-07 01:07:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-11-07 01:07:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 59682 transitions. [2019-11-07 01:07:24,126 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 59682 transitions. Word has length 168 [2019-11-07 01:07:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:24,127 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 59682 transitions. [2019-11-07 01:07:24,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 59682 transitions. [2019-11-07 01:07:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:07:24,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:24,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:24,139 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash -808861162, now seen corresponding path program 1 times [2019-11-07 01:07:24,139 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:24,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898136456] [2019-11-07 01:07:24,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:24,351 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898136456] [2019-11-07 01:07:24,351 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:24,351 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:24,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674274892] [2019-11-07 01:07:24,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:24,352 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:24,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:24,353 INFO L87 Difference]: Start difference. First operand 38738 states and 59682 transitions. Second operand 9 states. [2019-11-07 01:07:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:32,084 INFO L93 Difference]: Finished difference Result 185670 states and 287874 transitions. [2019-11-07 01:07:32,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:07:32,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-11-07 01:07:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:32,274 INFO L225 Difference]: With dead ends: 185670 [2019-11-07 01:07:32,274 INFO L226 Difference]: Without dead ends: 147342 [2019-11-07 01:07:32,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:07:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147342 states.