./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f621ab4908749e263e6fb16e731498fd137a7d6c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:17:25,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:17:25,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:17:26,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:17:26,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:17:26,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:17:26,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:17:26,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:17:26,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:17:26,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:17:26,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:17:26,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:17:26,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:17:26,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:17:26,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:17:26,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:17:26,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:17:26,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:17:26,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:17:26,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:17:26,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:17:26,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:17:26,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:17:26,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:17:26,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:17:26,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:17:26,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:17:26,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:17:26,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:17:26,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:17:26,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:17:26,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:17:26,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:17:26,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:17:26,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:17:26,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:17:26,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:17:26,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:17:26,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:17:26,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:17:26,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:17:26,051 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 17:17:26,067 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:17:26,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:17:26,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:17:26,068 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:17:26,068 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:17:26,068 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:17:26,069 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:17:26,069 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:17:26,070 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:17:26,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:17:26,070 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:17:26,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:17:26,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:17:26,071 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:17:26,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:17:26,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:17:26,072 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:17:26,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:17:26,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:17:26,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:17:26,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:17:26,073 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f621ab4908749e263e6fb16e731498fd137a7d6c [2020-12-09 17:17:26,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:17:26,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:17:26,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:17:26,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:17:26,274 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:17:26,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-09 17:17:26,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/data/0fac82d2e/5348666fef444c698edf06c7e81a232a/FLAG680890a18 [2020-12-09 17:17:26,721 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:17:26,722 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-09 17:17:26,731 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/data/0fac82d2e/5348666fef444c698edf06c7e81a232a/FLAG680890a18 [2020-12-09 17:17:26,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/data/0fac82d2e/5348666fef444c698edf06c7e81a232a [2020-12-09 17:17:26,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:17:26,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:17:26,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:17:26,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:17:26,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:17:26,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:17:26" (1/1) ... [2020-12-09 17:17:26,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6749840b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:26, skipping insertion in model container [2020-12-09 17:17:26,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:17:26" (1/1) ... [2020-12-09 17:17:26,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:17:26,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:17:26,971 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2020-12-09 17:17:26,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:17:26,980 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:17:27,023 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2020-12-09 17:17:27,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:17:27,037 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:17:27,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27 WrapperNode [2020-12-09 17:17:27,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:17:27,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:17:27,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:17:27,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:17:27,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:17:27,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:17:27,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:17:27,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:17:27,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... [2020-12-09 17:17:27,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:17:27,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:17:27,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:17:27,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:17:27,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/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 [2020-12-09 17:17:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:17:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 17:17:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:17:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:17:28,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:17:28,361 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2020-12-09 17:17:28,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:28 BoogieIcfgContainer [2020-12-09 17:17:28,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:17:28,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:17:28,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:17:28,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:17:28,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:17:26" (1/3) ... [2020-12-09 17:17:28,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c5773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:17:28, skipping insertion in model container [2020-12-09 17:17:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:27" (2/3) ... [2020-12-09 17:17:28,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c5773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:17:28, skipping insertion in model container [2020-12-09 17:17:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:28" (3/3) ... [2020-12-09 17:17:28,368 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-09 17:17:28,378 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:17:28,381 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-09 17:17:28,392 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-09 17:17:28,416 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:17:28,416 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:17:28,416 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:17:28,416 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:17:28,416 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:17:28,417 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:17:28,417 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:17:28,417 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:17:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2020-12-09 17:17:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 17:17:28,440 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:28,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:17:28,441 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1628696268, now seen corresponding path program 1 times [2020-12-09 17:17:28,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:28,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458794510] [2020-12-09 17:17:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:28,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458794510] [2020-12-09 17:17:28,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:28,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:28,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183374985] [2020-12-09 17:17:28,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:28,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:28,662 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2020-12-09 17:17:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:28,735 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2020-12-09 17:17:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:28,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 17:17:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:28,746 INFO L225 Difference]: With dead ends: 477 [2020-12-09 17:17:28,746 INFO L226 Difference]: Without dead ends: 238 [2020-12-09 17:17:28,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-12-09 17:17:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-12-09 17:17:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-09 17:17:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-12-09 17:17:28,788 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2020-12-09 17:17:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:28,789 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-12-09 17:17:28,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-12-09 17:17:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 17:17:28,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:28,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:17:28,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:17:28,790 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1565212023, now seen corresponding path program 1 times [2020-12-09 17:17:28,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:28,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825682251] [2020-12-09 17:17:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:28,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825682251] [2020-12-09 17:17:28,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:28,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:17:28,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809006996] [2020-12-09 17:17:28,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:17:28,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:17:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:28,885 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 6 states. [2020-12-09 17:17:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:28,977 INFO L93 Difference]: Finished difference Result 664 states and 967 transitions. [2020-12-09 17:17:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 17:17:28,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 17:17:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:28,982 INFO L225 Difference]: With dead ends: 664 [2020-12-09 17:17:28,983 INFO L226 Difference]: Without dead ends: 452 [2020-12-09 17:17:28,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-09 17:17:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 235. [2020-12-09 17:17:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-12-09 17:17:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2020-12-09 17:17:29,007 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2020-12-09 17:17:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,007 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2020-12-09 17:17:29,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:17:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2020-12-09 17:17:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 17:17:29,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:17:29,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 17:17:29,009 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -123787735, now seen corresponding path program 1 times [2020-12-09 17:17:29,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228120854] [2020-12-09 17:17:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228120854] [2020-12-09 17:17:29,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:17:29,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040197] [2020-12-09 17:17:29,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 17:17:29,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 17:17:29,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:17:29,087 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2020-12-09 17:17:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,166 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2020-12-09 17:17:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 17:17:29,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 17:17:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,171 INFO L225 Difference]: With dead ends: 861 [2020-12-09 17:17:29,171 INFO L226 Difference]: Without dead ends: 649 [2020-12-09 17:17:29,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 17:17:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-12-09 17:17:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2020-12-09 17:17:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-09 17:17:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2020-12-09 17:17:29,187 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2020-12-09 17:17:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,187 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2020-12-09 17:17:29,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 17:17:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2020-12-09 17:17:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 17:17:29,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:17:29,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 17:17:29,188 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1130743666, now seen corresponding path program 1 times [2020-12-09 17:17:29,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029993717] [2020-12-09 17:17:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029993717] [2020-12-09 17:17:29,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:17:29,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414322697] [2020-12-09 17:17:29,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:17:29,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:17:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:29,253 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 6 states. [2020-12-09 17:17:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,338 INFO L93 Difference]: Finished difference Result 667 states and 970 transitions. [2020-12-09 17:17:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 17:17:29,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 17:17:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,341 INFO L225 Difference]: With dead ends: 667 [2020-12-09 17:17:29,342 INFO L226 Difference]: Without dead ends: 455 [2020-12-09 17:17:29,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-12-09 17:17:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 237. [2020-12-09 17:17:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-12-09 17:17:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 345 transitions. [2020-12-09 17:17:29,355 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 345 transitions. Word has length 18 [2020-12-09 17:17:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,355 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 345 transitions. [2020-12-09 17:17:29,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:17:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 345 transitions. [2020-12-09 17:17:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 17:17:29,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:17:29,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 17:17:29,357 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -372278167, now seen corresponding path program 1 times [2020-12-09 17:17:29,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726128782] [2020-12-09 17:17:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726128782] [2020-12-09 17:17:29,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:29,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469807954] [2020-12-09 17:17:29,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:29,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,420 INFO L87 Difference]: Start difference. First operand 237 states and 345 transitions. Second operand 3 states. [2020-12-09 17:17:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,460 INFO L93 Difference]: Finished difference Result 477 states and 696 transitions. [2020-12-09 17:17:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:29,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-09 17:17:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,462 INFO L225 Difference]: With dead ends: 477 [2020-12-09 17:17:29,462 INFO L226 Difference]: Without dead ends: 265 [2020-12-09 17:17:29,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-12-09 17:17:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2020-12-09 17:17:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-09 17:17:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 337 transitions. [2020-12-09 17:17:29,471 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 337 transitions. Word has length 18 [2020-12-09 17:17:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,471 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 337 transitions. [2020-12-09 17:17:29,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2020-12-09 17:17:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 17:17:29,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,473 INFO L422 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] [2020-12-09 17:17:29,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 17:17:29,473 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash 76498753, now seen corresponding path program 1 times [2020-12-09 17:17:29,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482972353] [2020-12-09 17:17:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482972353] [2020-12-09 17:17:29,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:29,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733955366] [2020-12-09 17:17:29,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:29,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,520 INFO L87 Difference]: Start difference. First operand 232 states and 337 transitions. Second operand 3 states. [2020-12-09 17:17:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,577 INFO L93 Difference]: Finished difference Result 476 states and 695 transitions. [2020-12-09 17:17:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:29,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-09 17:17:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,580 INFO L225 Difference]: With dead ends: 476 [2020-12-09 17:17:29,580 INFO L226 Difference]: Without dead ends: 269 [2020-12-09 17:17:29,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-09 17:17:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2020-12-09 17:17:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-09 17:17:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2020-12-09 17:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 22 [2020-12-09 17:17:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,592 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2020-12-09 17:17:29,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2020-12-09 17:17:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 17:17:29,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,594 INFO L422 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] [2020-12-09 17:17:29,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 17:17:29,594 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash -766771815, now seen corresponding path program 1 times [2020-12-09 17:17:29,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096863938] [2020-12-09 17:17:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096863938] [2020-12-09 17:17:29,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:29,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346930832] [2020-12-09 17:17:29,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:29,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,647 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand 3 states. [2020-12-09 17:17:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,690 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2020-12-09 17:17:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:29,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-09 17:17:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,693 INFO L225 Difference]: With dead ends: 444 [2020-12-09 17:17:29,693 INFO L226 Difference]: Without dead ends: 257 [2020-12-09 17:17:29,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-12-09 17:17:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 200. [2020-12-09 17:17:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-09 17:17:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2020-12-09 17:17:29,703 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 26 [2020-12-09 17:17:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,704 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2020-12-09 17:17:29,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2020-12-09 17:17:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 17:17:29,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,705 INFO L422 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] [2020-12-09 17:17:29,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 17:17:29,705 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2009439771, now seen corresponding path program 1 times [2020-12-09 17:17:29,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546248374] [2020-12-09 17:17:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546248374] [2020-12-09 17:17:29,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:29,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250514792] [2020-12-09 17:17:29,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:29,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,760 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand 3 states. [2020-12-09 17:17:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,809 INFO L93 Difference]: Finished difference Result 440 states and 631 transitions. [2020-12-09 17:17:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:29,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-09 17:17:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,811 INFO L225 Difference]: With dead ends: 440 [2020-12-09 17:17:29,811 INFO L226 Difference]: Without dead ends: 265 [2020-12-09 17:17:29,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-12-09 17:17:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 180. [2020-12-09 17:17:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-09 17:17:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 255 transitions. [2020-12-09 17:17:29,818 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 255 transitions. Word has length 27 [2020-12-09 17:17:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,819 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 255 transitions. [2020-12-09 17:17:29,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 255 transitions. [2020-12-09 17:17:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 17:17:29,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,820 INFO L422 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] [2020-12-09 17:17:29,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 17:17:29,820 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash 86559853, now seen corresponding path program 1 times [2020-12-09 17:17:29,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931433934] [2020-12-09 17:17:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:29,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931433934] [2020-12-09 17:17:29,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:29,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:17:29,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55366301] [2020-12-09 17:17:29,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:17:29,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:17:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:17:29,910 INFO L87 Difference]: Start difference. First operand 180 states and 255 transitions. Second operand 4 states. [2020-12-09 17:17:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:29,949 INFO L93 Difference]: Finished difference Result 512 states and 717 transitions. [2020-12-09 17:17:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:17:29,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 17:17:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:29,952 INFO L225 Difference]: With dead ends: 512 [2020-12-09 17:17:29,952 INFO L226 Difference]: Without dead ends: 342 [2020-12-09 17:17:29,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:17:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-12-09 17:17:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 184. [2020-12-09 17:17:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-12-09 17:17:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2020-12-09 17:17:29,965 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 259 transitions. Word has length 32 [2020-12-09 17:17:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:29,965 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 259 transitions. [2020-12-09 17:17:29,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:17:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2020-12-09 17:17:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 17:17:29,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:29,966 INFO L422 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] [2020-12-09 17:17:29,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 17:17:29,967 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash -137756106, now seen corresponding path program 1 times [2020-12-09 17:17:29,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:29,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386975758] [2020-12-09 17:17:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:30,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386975758] [2020-12-09 17:17:30,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:30,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:17:30,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871502385] [2020-12-09 17:17:30,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:17:30,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:17:30,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:30,072 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. Second operand 6 states. [2020-12-09 17:17:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:30,222 INFO L93 Difference]: Finished difference Result 629 states and 873 transitions. [2020-12-09 17:17:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 17:17:30,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-12-09 17:17:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:30,225 INFO L225 Difference]: With dead ends: 629 [2020-12-09 17:17:30,225 INFO L226 Difference]: Without dead ends: 472 [2020-12-09 17:17:30,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 17:17:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-12-09 17:17:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 219. [2020-12-09 17:17:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-12-09 17:17:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2020-12-09 17:17:30,236 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 34 [2020-12-09 17:17:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:30,237 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2020-12-09 17:17:30,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:17:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2020-12-09 17:17:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 17:17:30,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:30,238 INFO L422 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] [2020-12-09 17:17:30,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 17:17:30,238 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1582358541, now seen corresponding path program 1 times [2020-12-09 17:17:30,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:30,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964477230] [2020-12-09 17:17:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:30,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964477230] [2020-12-09 17:17:30,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:30,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:30,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342678667] [2020-12-09 17:17:30,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:30,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:30,288 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand 3 states. [2020-12-09 17:17:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:30,323 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2020-12-09 17:17:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:30,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-09 17:17:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:30,324 INFO L225 Difference]: With dead ends: 399 [2020-12-09 17:17:30,324 INFO L226 Difference]: Without dead ends: 242 [2020-12-09 17:17:30,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-09 17:17:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2020-12-09 17:17:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-12-09 17:17:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2020-12-09 17:17:30,334 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 35 [2020-12-09 17:17:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:30,334 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2020-12-09 17:17:30,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2020-12-09 17:17:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 17:17:30,335 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:30,335 INFO L422 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] [2020-12-09 17:17:30,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 17:17:30,335 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 702778323, now seen corresponding path program 1 times [2020-12-09 17:17:30,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:30,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609127465] [2020-12-09 17:17:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:30,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609127465] [2020-12-09 17:17:30,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:30,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:30,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042459416] [2020-12-09 17:17:30,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:17:30,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:17:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:30,369 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 3 states. [2020-12-09 17:17:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:30,406 INFO L93 Difference]: Finished difference Result 457 states and 637 transitions. [2020-12-09 17:17:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:17:30,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-09 17:17:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:30,408 INFO L225 Difference]: With dead ends: 457 [2020-12-09 17:17:30,408 INFO L226 Difference]: Without dead ends: 287 [2020-12-09 17:17:30,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:17:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-09 17:17:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2020-12-09 17:17:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-09 17:17:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2020-12-09 17:17:30,418 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 35 [2020-12-09 17:17:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:30,418 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2020-12-09 17:17:30,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:17:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2020-12-09 17:17:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 17:17:30,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:30,419 INFO L422 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] [2020-12-09 17:17:30,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 17:17:30,419 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1960309012, now seen corresponding path program 1 times [2020-12-09 17:17:30,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:30,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302313745] [2020-12-09 17:17:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:30,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302313745] [2020-12-09 17:17:30,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:30,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:17:30,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340833810] [2020-12-09 17:17:30,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:17:30,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:17:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:17:30,457 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand 4 states. [2020-12-09 17:17:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:30,523 INFO L93 Difference]: Finished difference Result 632 states and 866 transitions. [2020-12-09 17:17:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 17:17:30,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-09 17:17:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:30,526 INFO L225 Difference]: With dead ends: 632 [2020-12-09 17:17:30,526 INFO L226 Difference]: Without dead ends: 481 [2020-12-09 17:17:30,527 INFO L677 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 [2020-12-09 17:17:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-09 17:17:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 315. [2020-12-09 17:17:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-09 17:17:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 427 transitions. [2020-12-09 17:17:30,557 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 427 transitions. Word has length 38 [2020-12-09 17:17:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:30,557 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 427 transitions. [2020-12-09 17:17:30,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:17:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 427 transitions. [2020-12-09 17:17:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 17:17:30,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:30,558 INFO L422 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] [2020-12-09 17:17:30,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 17:17:30,558 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash -604017043, now seen corresponding path program 1 times [2020-12-09 17:17:30,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:30,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468927807] [2020-12-09 17:17:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:30,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468927807] [2020-12-09 17:17:30,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:30,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 17:17:30,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159425758] [2020-12-09 17:17:30,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 17:17:30,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 17:17:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 17:17:30,640 INFO L87 Difference]: Start difference. First operand 315 states and 427 transitions. Second operand 7 states. [2020-12-09 17:17:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:30,977 INFO L93 Difference]: Finished difference Result 1175 states and 1601 transitions. [2020-12-09 17:17:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 17:17:30,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-12-09 17:17:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:30,982 INFO L225 Difference]: With dead ends: 1175 [2020-12-09 17:17:30,982 INFO L226 Difference]: Without dead ends: 937 [2020-12-09 17:17:30,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 17:17:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2020-12-09 17:17:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 368. [2020-12-09 17:17:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-12-09 17:17:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 498 transitions. [2020-12-09 17:17:31,011 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 498 transitions. Word has length 38 [2020-12-09 17:17:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:31,011 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 498 transitions. [2020-12-09 17:17:31,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 17:17:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 498 transitions. [2020-12-09 17:17:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 17:17:31,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:31,012 INFO L422 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] [2020-12-09 17:17:31,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 17:17:31,012 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1082465882, now seen corresponding path program 1 times [2020-12-09 17:17:31,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:31,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425769522] [2020-12-09 17:17:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:31,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425769522] [2020-12-09 17:17:31,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:31,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:17:31,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839872266] [2020-12-09 17:17:31,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 17:17:31,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 17:17:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:17:31,088 INFO L87 Difference]: Start difference. First operand 368 states and 498 transitions. Second operand 5 states. [2020-12-09 17:17:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:31,265 INFO L93 Difference]: Finished difference Result 761 states and 1035 transitions. [2020-12-09 17:17:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 17:17:31,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-09 17:17:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:31,269 INFO L225 Difference]: With dead ends: 761 [2020-12-09 17:17:31,269 INFO L226 Difference]: Without dead ends: 759 [2020-12-09 17:17:31,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 17:17:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-12-09 17:17:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 370. [2020-12-09 17:17:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-12-09 17:17:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 500 transitions. [2020-12-09 17:17:31,292 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 500 transitions. Word has length 39 [2020-12-09 17:17:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:31,293 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 500 transitions. [2020-12-09 17:17:31,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 17:17:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 500 transitions. [2020-12-09 17:17:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 17:17:31,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:31,293 INFO L422 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] [2020-12-09 17:17:31,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 17:17:31,293 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1098196191, now seen corresponding path program 1 times [2020-12-09 17:17:31,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:31,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23070528] [2020-12-09 17:17:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:31,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23070528] [2020-12-09 17:17:31,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:31,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:17:31,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431566139] [2020-12-09 17:17:31,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:17:31,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:17:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:31,383 INFO L87 Difference]: Start difference. First operand 370 states and 500 transitions. Second operand 6 states. [2020-12-09 17:17:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:31,597 INFO L93 Difference]: Finished difference Result 1165 states and 1588 transitions. [2020-12-09 17:17:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 17:17:31,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-12-09 17:17:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:31,603 INFO L225 Difference]: With dead ends: 1165 [2020-12-09 17:17:31,603 INFO L226 Difference]: Without dead ends: 923 [2020-12-09 17:17:31,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 17:17:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2020-12-09 17:17:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 374. [2020-12-09 17:17:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-12-09 17:17:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 505 transitions. [2020-12-09 17:17:31,643 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 505 transitions. Word has length 39 [2020-12-09 17:17:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:31,643 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 505 transitions. [2020-12-09 17:17:31,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:17:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 505 transitions. [2020-12-09 17:17:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 17:17:31,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:31,644 INFO L422 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] [2020-12-09 17:17:31,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 17:17:31,645 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 390899289, now seen corresponding path program 1 times [2020-12-09 17:17:31,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:31,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210163070] [2020-12-09 17:17:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:31,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210163070] [2020-12-09 17:17:31,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:31,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:17:31,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644165187] [2020-12-09 17:17:31,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:17:31,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:17:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:17:31,673 INFO L87 Difference]: Start difference. First operand 374 states and 505 transitions. Second operand 4 states. [2020-12-09 17:17:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:31,753 INFO L93 Difference]: Finished difference Result 834 states and 1119 transitions. [2020-12-09 17:17:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 17:17:31,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-09 17:17:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:31,756 INFO L225 Difference]: With dead ends: 834 [2020-12-09 17:17:31,756 INFO L226 Difference]: Without dead ends: 492 [2020-12-09 17:17:31,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:17:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-12-09 17:17:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 328. [2020-12-09 17:17:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-12-09 17:17:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 438 transitions. [2020-12-09 17:17:31,782 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 438 transitions. Word has length 40 [2020-12-09 17:17:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:31,782 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 438 transitions. [2020-12-09 17:17:31,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:17:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 438 transitions. [2020-12-09 17:17:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 17:17:31,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:31,783 INFO L422 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] [2020-12-09 17:17:31,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 17:17:31,783 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1229637880, now seen corresponding path program 1 times [2020-12-09 17:17:31,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:31,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224482816] [2020-12-09 17:17:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:31,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224482816] [2020-12-09 17:17:31,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:31,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 17:17:31,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348302978] [2020-12-09 17:17:31,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:17:31,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:31,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:17:31,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 17:17:31,858 INFO L87 Difference]: Start difference. First operand 328 states and 438 transitions. Second operand 6 states. [2020-12-09 17:17:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:31,960 INFO L93 Difference]: Finished difference Result 723 states and 1003 transitions. [2020-12-09 17:17:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 17:17:31,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-12-09 17:17:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:31,963 INFO L225 Difference]: With dead ends: 723 [2020-12-09 17:17:31,963 INFO L226 Difference]: Without dead ends: 481 [2020-12-09 17:17:31,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 17:17:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-09 17:17:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 324. [2020-12-09 17:17:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-09 17:17:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2020-12-09 17:17:31,988 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 40 [2020-12-09 17:17:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:31,988 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2020-12-09 17:17:31,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:17:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2020-12-09 17:17:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 17:17:31,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:31,989 INFO L422 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] [2020-12-09 17:17:31,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 17:17:31,989 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 192835145, now seen corresponding path program 1 times [2020-12-09 17:17:31,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:31,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172949862] [2020-12-09 17:17:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:17:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:17:32,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172949862] [2020-12-09 17:17:32,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:17:32,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 17:17:32,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483432357] [2020-12-09 17:17:32,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 17:17:32,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:17:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 17:17:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 17:17:32,076 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand 7 states. [2020-12-09 17:17:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:17:32,394 INFO L93 Difference]: Finished difference Result 1537 states and 2046 transitions. [2020-12-09 17:17:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 17:17:32,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-09 17:17:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:17:32,400 INFO L225 Difference]: With dead ends: 1537 [2020-12-09 17:17:32,400 INFO L226 Difference]: Without dead ends: 1281 [2020-12-09 17:17:32,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 17:17:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2020-12-09 17:17:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 404. [2020-12-09 17:17:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-12-09 17:17:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 531 transitions. [2020-12-09 17:17:32,448 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 531 transitions. Word has length 40 [2020-12-09 17:17:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:17:32,448 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 531 transitions. [2020-12-09 17:17:32,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 17:17:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 531 transitions. [2020-12-09 17:17:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 17:17:32,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:17:32,449 INFO L422 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] [2020-12-09 17:17:32,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 17:17:32,449 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:17:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:17:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1659677141, now seen corresponding path program 1 times [2020-12-09 17:17:32,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:17:32,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684749332] [2020-12-09 17:17:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:17:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:17:32,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:17:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:17:32,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:17:32,557 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 17:17:32,557 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 17:17:32,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 17:17:32,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:17:32 BoogieIcfgContainer [2020-12-09 17:17:32,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:17:32,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:17:32,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:17:32,635 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:17:32,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:28" (3/4) ... [2020-12-09 17:17:32,637 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 17:17:32,711 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1e2f8f4a-8eb3-4395-8e9d-76f6f32b37a1/bin/utaipan/witness.graphml [2020-12-09 17:17:32,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:17:32,713 INFO L168 Benchmark]: Toolchain (without parser) took 5965.62 ms. Allocated memory was 100.7 MB in the beginning and 222.3 MB in the end (delta: 121.6 MB). Free memory was 60.1 MB in the beginning and 114.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 69.9 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,713 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 100.7 MB. Free memory was 77.1 MB in the beginning and 77.0 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:17:32,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.01 ms. Allocated memory is still 100.7 MB. Free memory was 59.8 MB in the beginning and 68.4 MB in the end (delta: -8.6 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.28 ms. Allocated memory is still 100.7 MB. Free memory was 68.4 MB in the beginning and 63.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,714 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 100.7 MB. Free memory was 63.9 MB in the beginning and 60.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,714 INFO L168 Benchmark]: RCFGBuilder took 1235.09 ms. Allocated memory was 100.7 MB in the beginning and 123.7 MB in the end (delta: 23.1 MB). Free memory was 60.0 MB in the beginning and 40.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,714 INFO L168 Benchmark]: TraceAbstraction took 4270.91 ms. Allocated memory was 123.7 MB in the beginning and 222.3 MB in the end (delta: 98.6 MB). Free memory was 39.0 MB in the beginning and 130.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,714 INFO L168 Benchmark]: Witness Printer took 76.35 ms. Allocated memory is still 222.3 MB. Free memory was 130.9 MB in the beginning and 114.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:17:32,716 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 100.7 MB. Free memory was 77.1 MB in the beginning and 77.0 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 290.01 ms. Allocated memory is still 100.7 MB. Free memory was 59.8 MB in the beginning and 68.4 MB in the end (delta: -8.6 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.28 ms. Allocated memory is still 100.7 MB. Free memory was 68.4 MB in the beginning and 63.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 100.7 MB. Free memory was 63.9 MB in the beginning and 60.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1235.09 ms. Allocated memory was 100.7 MB in the beginning and 123.7 MB in the end (delta: 23.1 MB). Free memory was 60.0 MB in the beginning and 40.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4270.91 ms. Allocated memory was 123.7 MB in the beginning and 222.3 MB in the end (delta: 98.6 MB). Free memory was 39.0 MB in the beginning and 130.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Witness Printer took 76.35 ms. Allocated memory is still 222.3 MB. Free memory was 130.9 MB in the beginning and 114.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] i2 = init() [L58] COND FALSE !(!cond) [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 [L58] COND FALSE !(!cond) [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L604] c1 = check() [L617] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 238 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6281 SDtfs, 7920 SDslu, 12389 SDs, 0 SdLazy, 883 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 4502 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 63105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...