./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH --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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:16:05,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:16:05,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:16:05,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:16:05,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:16:05,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:16:05,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:16:05,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:16:05,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:16:05,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:16:05,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:16:05,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:16:05,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:16:05,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:16:05,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:16:05,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:16:05,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:16:05,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:16:05,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:16:05,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:16:05,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:16:05,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:16:05,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:16:05,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:16:05,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:16:05,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:16:05,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:16:05,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:16:05,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:16:05,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:16:05,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:16:05,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:16:05,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:16:05,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:16:05,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:16:05,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:16:05,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:16:05,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:16:05,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:16:05,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:16:05,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:16:05,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:16:05,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:16:05,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:16:05,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:16:05,897 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:16:05,897 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:16:05,897 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:16:05,898 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:16:05,898 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:16:05,898 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:16:05,898 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:16:05,899 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:16:05,900 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:16:05,900 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:16:05,900 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:16:05,900 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:16:05,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:16:05,901 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:16:05,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:16:05,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:16:05,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:16:05,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:16:05,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:16:05,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:16:05,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:16:05,903 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:16:05,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:16:05,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:16:05,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:16:05,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:16:05,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:16:05,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:16:05,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:16:05,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:16:05,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:16:05,908 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_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/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_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2021-11-03 04:16:06,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:16:06,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:16:06,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:16:06,179 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:16:06,180 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:16:06,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-03 04:16:06,237 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/data/a25c41836/53c0ffce406b487c9e2ad078c73c9d57/FLAG8908b75a4 [2021-11-03 04:16:06,790 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:16:06,791 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-03 04:16:06,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/data/a25c41836/53c0ffce406b487c9e2ad078c73c9d57/FLAG8908b75a4 [2021-11-03 04:16:07,087 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/data/a25c41836/53c0ffce406b487c9e2ad078c73c9d57 [2021-11-03 04:16:07,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:16:07,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:16:07,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:16:07,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:16:07,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:16:07,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3598ecd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07, skipping insertion in model container [2021-11-03 04:16:07,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:16:07,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:16:07,336 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-11-03 04:16:07,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:16:07,634 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:16:07,647 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-11-03 04:16:07,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:16:07,837 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:16:07,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07 WrapperNode [2021-11-03 04:16:07,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:16:07,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:16:07,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:16:07,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:16:07,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:16:07,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:16:07,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:16:07,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:16:07,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:07,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:08,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:08,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:08,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:16:08,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:16:08,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:16:08,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:16:08,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (1/1) ... [2021-11-03 04:16:08,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:16:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:16:08,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:16:08,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:16:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 04:16:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-03 04:16:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:16:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:16:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-03 04:16:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-03 04:16:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-03 04:16:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-03 04:16:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-03 04:16:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-03 04:16:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-11-03 04:16:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-11-03 04:16:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:16:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-03 04:16:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:16:08,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:16:08,135 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 04:16:09,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:16:09,870 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-03 04:16:09,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:16:09 BoogieIcfgContainer [2021-11-03 04:16:09,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:16:09,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:16:09,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:16:09,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:16:09,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:16:07" (1/3) ... [2021-11-03 04:16:09,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d5ba8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:16:09, skipping insertion in model container [2021-11-03 04:16:09,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:16:07" (2/3) ... [2021-11-03 04:16:09,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d5ba8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:16:09, skipping insertion in model container [2021-11-03 04:16:09,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:16:09" (3/3) ... [2021-11-03 04:16:09,882 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-03 04:16:09,887 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 04:16:09,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:16:09,887 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-03 04:16:09,888 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,935 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,935 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,944 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,969 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,989 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,999 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:09,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,004 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,004 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 04:16:10,006 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-03 04:16:10,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:16:10,058 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:16:10,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-03 04:16:10,073 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 04:16:10,083 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 268 flow [2021-11-03 04:16:10,086 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 268 flow [2021-11-03 04:16:10,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2021-11-03 04:16:10,136 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2021-11-03 04:16:10,136 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-03 04:16:10,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-11-03 04:16:10,146 INFO L116 LiptonReduction]: Number of co-enabled transitions 2682 [2021-11-03 04:16:25,319 INFO L131 LiptonReduction]: Checked pairs total: 6268 [2021-11-03 04:16:25,319 INFO L133 LiptonReduction]: Total number of compositions: 101 [2021-11-03 04:16:25,330 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2021-11-03 04:16:25,466 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 04:16:25,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:25,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:25,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1638475840, now seen corresponding path program 1 times [2021-11-03 04:16:25,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:25,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712418813] [2021-11-03 04:16:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:25,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:25,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:25,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712418813] [2021-11-03 04:16:25,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712418813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:25,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:25,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:16:25,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513709041] [2021-11-03 04:16:25,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:16:25,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:16:25,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:25,832 INFO L87 Difference]: Start difference. First operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:25,985 INFO L93 Difference]: Finished difference Result 1882 states and 7048 transitions. [2021-11-03 04:16:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:16:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 04:16:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:26,045 INFO L225 Difference]: With dead ends: 1882 [2021-11-03 04:16:26,045 INFO L226 Difference]: Without dead ends: 1802 [2021-11-03 04:16:26,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-11-03 04:16:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2021-11-03 04:16:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.7667962243198225) internal successors, (6784), 1801 states have internal predecessors, (6784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2021-11-03 04:16:26,207 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2021-11-03 04:16:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:26,208 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2021-11-03 04:16:26,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2021-11-03 04:16:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:16:26,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:26,212 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:26,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:16:26,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1677622827, now seen corresponding path program 1 times [2021-11-03 04:16:26,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:26,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167227553] [2021-11-03 04:16:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:26,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:26,419 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:26,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167227553] [2021-11-03 04:16:26,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167227553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:26,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:26,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:16:26,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683666943] [2021-11-03 04:16:26,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:16:26,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:16:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:26,429 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:26,470 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2021-11-03 04:16:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:16:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-03 04:16:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:26,492 INFO L225 Difference]: With dead ends: 1752 [2021-11-03 04:16:26,492 INFO L226 Difference]: Without dead ends: 1752 [2021-11-03 04:16:26,492 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-11-03 04:16:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2021-11-03 04:16:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 3.743003997715591) internal successors, (6554), 1751 states have internal predecessors, (6554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2021-11-03 04:16:26,584 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2021-11-03 04:16:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:26,584 INFO L470 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2021-11-03 04:16:26,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2021-11-03 04:16:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:16:26,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:26,591 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:26,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:16:26,594 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1241052862, now seen corresponding path program 1 times [2021-11-03 04:16:26,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:26,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059287073] [2021-11-03 04:16:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:26,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:26,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:26,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059287073] [2021-11-03 04:16:26,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059287073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:26,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:26,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:16:26,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646952043] [2021-11-03 04:16:26,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:16:26,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:26,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:16:26,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:26,823 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:26,858 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2021-11-03 04:16:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:16:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 04:16:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:26,878 INFO L225 Difference]: With dead ends: 1722 [2021-11-03 04:16:26,879 INFO L226 Difference]: Without dead ends: 1722 [2021-11-03 04:16:26,879 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-11-03 04:16:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2021-11-03 04:16:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 3.730389308541546) internal successors, (6420), 1721 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2021-11-03 04:16:26,959 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2021-11-03 04:16:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:26,960 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2021-11-03 04:16:26,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2021-11-03 04:16:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:16:26,962 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:26,962 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:26,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:16:26,963 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1771173454, now seen corresponding path program 1 times [2021-11-03 04:16:26,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:26,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640023491] [2021-11-03 04:16:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:26,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:27,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:27,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640023491] [2021-11-03 04:16:27,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640023491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:27,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:27,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:16:27,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445523764] [2021-11-03 04:16:27,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:16:27,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:16:27,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:27,065 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:27,102 INFO L93 Difference]: Finished difference Result 2386 states and 8562 transitions. [2021-11-03 04:16:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:16:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:16:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:27,122 INFO L225 Difference]: With dead ends: 2386 [2021-11-03 04:16:27,123 INFO L226 Difference]: Without dead ends: 1842 [2021-11-03 04:16:27,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-03 04:16:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1682. [2021-11-03 04:16:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 3.5609756097560976) internal successors, (5986), 1681 states have internal predecessors, (5986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2021-11-03 04:16:27,243 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 13 [2021-11-03 04:16:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:27,244 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2021-11-03 04:16:27,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2021-11-03 04:16:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:16:27,247 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:27,247 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:27,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:16:27,247 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1081592393, now seen corresponding path program 1 times [2021-11-03 04:16:27,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:27,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425735223] [2021-11-03 04:16:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:27,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:27,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:27,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425735223] [2021-11-03 04:16:27,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425735223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:27,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:27,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:16:27,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478684626] [2021-11-03 04:16:27,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:16:27,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:16:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:16:27,466 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:27,528 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2021-11-03 04:16:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:16:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:16:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:27,546 INFO L225 Difference]: With dead ends: 1640 [2021-11-03 04:16:27,546 INFO L226 Difference]: Without dead ends: 1640 [2021-11-03 04:16:27,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:16:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-03 04:16:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-03 04:16:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.538743136058572) internal successors, (5800), 1639 states have internal predecessors, (5800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2021-11-03 04:16:27,611 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 13 [2021-11-03 04:16:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:27,611 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2021-11-03 04:16:27,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2021-11-03 04:16:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 04:16:27,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:27,614 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:27,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:16:27,615 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1872787779, now seen corresponding path program 1 times [2021-11-03 04:16:27,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:27,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456611832] [2021-11-03 04:16:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:27,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:27,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:27,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456611832] [2021-11-03 04:16:27,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456611832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:27,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:27,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:16:27,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107515323] [2021-11-03 04:16:27,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:16:27,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:16:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:16:27,827 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:27,917 INFO L93 Difference]: Finished difference Result 1598 states and 5628 transitions. [2021-11-03 04:16:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:16:27,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-03 04:16:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:27,935 INFO L225 Difference]: With dead ends: 1598 [2021-11-03 04:16:27,935 INFO L226 Difference]: Without dead ends: 1598 [2021-11-03 04:16:27,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:16:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-03 04:16:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-03 04:16:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 3.5241077019411398) internal successors, (5628), 1597 states have internal predecessors, (5628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 5628 transitions. [2021-11-03 04:16:27,995 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 5628 transitions. Word has length 14 [2021-11-03 04:16:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 5628 transitions. [2021-11-03 04:16:27,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 5628 transitions. [2021-11-03 04:16:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:16:28,000 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:28,000 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:28,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:16:28,001 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2073075207, now seen corresponding path program 1 times [2021-11-03 04:16:28,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:28,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672514633] [2021-11-03 04:16:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:28,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:28,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:28,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672514633] [2021-11-03 04:16:28,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672514633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:28,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:28,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:16:28,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827687666] [2021-11-03 04:16:28,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:16:28,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:16:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:28,192 INFO L87 Difference]: Start difference. First operand 1598 states and 5628 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:28,292 INFO L93 Difference]: Finished difference Result 1710 states and 6056 transitions. [2021-11-03 04:16:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:16:28,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 04:16:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:28,315 INFO L225 Difference]: With dead ends: 1710 [2021-11-03 04:16:28,315 INFO L226 Difference]: Without dead ends: 1710 [2021-11-03 04:16:28,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-11-03 04:16:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2021-11-03 04:16:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 3.543592744294909) internal successors, (6056), 1709 states have internal predecessors, (6056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 6056 transitions. [2021-11-03 04:16:28,407 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 6056 transitions. Word has length 15 [2021-11-03 04:16:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:28,408 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 6056 transitions. [2021-11-03 04:16:28,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 6056 transitions. [2021-11-03 04:16:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:16:28,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:28,413 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:28,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:16:28,414 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2073119847, now seen corresponding path program 2 times [2021-11-03 04:16:28,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:28,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826271744] [2021-11-03 04:16:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:28,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:28,609 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:28,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826271744] [2021-11-03 04:16:28,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826271744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:28,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:28,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:16:28,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796338553] [2021-11-03 04:16:28,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:16:28,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:28,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:16:28,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:28,611 INFO L87 Difference]: Start difference. First operand 1710 states and 6056 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:28,697 INFO L93 Difference]: Finished difference Result 1934 states and 6816 transitions. [2021-11-03 04:16:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:16:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 04:16:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:28,733 INFO L225 Difference]: With dead ends: 1934 [2021-11-03 04:16:28,734 INFO L226 Difference]: Without dead ends: 1934 [2021-11-03 04:16:28,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2021-11-03 04:16:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1886. [2021-11-03 04:16:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.53315649867374) internal successors, (6660), 1885 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6660 transitions. [2021-11-03 04:16:28,810 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6660 transitions. Word has length 15 [2021-11-03 04:16:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:28,810 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 6660 transitions. [2021-11-03 04:16:28,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6660 transitions. [2021-11-03 04:16:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:16:28,814 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:28,814 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:28,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:16:28,815 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash -29626043, now seen corresponding path program 3 times [2021-11-03 04:16:28,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:28,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397981409] [2021-11-03 04:16:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:28,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:28,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:28,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397981409] [2021-11-03 04:16:28,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397981409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:28,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:28,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:16:28,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982869952] [2021-11-03 04:16:28,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:16:28,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:16:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:16:28,945 INFO L87 Difference]: Start difference. First operand 1886 states and 6660 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:29,052 INFO L93 Difference]: Finished difference Result 1982 states and 6946 transitions. [2021-11-03 04:16:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:16:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 04:16:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:29,084 INFO L225 Difference]: With dead ends: 1982 [2021-11-03 04:16:29,084 INFO L226 Difference]: Without dead ends: 1982 [2021-11-03 04:16:29,084 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-11-03 04:16:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1858. [2021-11-03 04:16:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 3.493807215939688) internal successors, (6488), 1857 states have internal predecessors, (6488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6488 transitions. [2021-11-03 04:16:29,165 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6488 transitions. Word has length 15 [2021-11-03 04:16:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:29,166 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 6488 transitions. [2021-11-03 04:16:29,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6488 transitions. [2021-11-03 04:16:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 04:16:29,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:29,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:29,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:16:29,171 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -159180566, now seen corresponding path program 1 times [2021-11-03 04:16:29,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:29,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225051119] [2021-11-03 04:16:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:29,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:29,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:29,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225051119] [2021-11-03 04:16:29,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225051119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:29,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:29,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:16:29,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586872615] [2021-11-03 04:16:29,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:16:29,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:16:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:29,341 INFO L87 Difference]: Start difference. First operand 1858 states and 6488 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:29,477 INFO L93 Difference]: Finished difference Result 2090 states and 7300 transitions. [2021-11-03 04:16:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:16:29,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-03 04:16:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:29,489 INFO L225 Difference]: With dead ends: 2090 [2021-11-03 04:16:29,489 INFO L226 Difference]: Without dead ends: 2090 [2021-11-03 04:16:29,489 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:16:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-11-03 04:16:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1610. [2021-11-03 04:16:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 3.487880671224363) internal successors, (5612), 1609 states have internal predecessors, (5612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5612 transitions. [2021-11-03 04:16:29,558 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5612 transitions. Word has length 16 [2021-11-03 04:16:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:29,560 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 5612 transitions. [2021-11-03 04:16:29,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5612 transitions. [2021-11-03 04:16:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 04:16:29,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:29,565 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:29,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:16:29,565 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -920960370, now seen corresponding path program 1 times [2021-11-03 04:16:29,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:29,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96919114] [2021-11-03 04:16:29,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:29,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:29,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:29,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96919114] [2021-11-03 04:16:29,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96919114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:29,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:29,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:16:29,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973299358] [2021-11-03 04:16:29,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:16:29,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:16:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:16:29,670 INFO L87 Difference]: Start difference. First operand 1610 states and 5612 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:29,713 INFO L93 Difference]: Finished difference Result 1715 states and 5456 transitions. [2021-11-03 04:16:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:16:29,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-03 04:16:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:29,719 INFO L225 Difference]: With dead ends: 1715 [2021-11-03 04:16:29,719 INFO L226 Difference]: Without dead ends: 1283 [2021-11-03 04:16:29,719 INFO L786 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 [2021-11-03 04:16:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-03 04:16:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-03 04:16:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 3.1630265210608424) internal successors, (4055), 1282 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 4055 transitions. [2021-11-03 04:16:29,764 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 4055 transitions. Word has length 16 [2021-11-03 04:16:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:29,764 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 4055 transitions. [2021-11-03 04:16:29,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 4055 transitions. [2021-11-03 04:16:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 04:16:29,769 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:29,769 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:29,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:16:29,770 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1239163265, now seen corresponding path program 1 times [2021-11-03 04:16:29,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:29,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444062384] [2021-11-03 04:16:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:29,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:29,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:29,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444062384] [2021-11-03 04:16:29,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444062384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:29,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:29,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:16:29,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346136690] [2021-11-03 04:16:29,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:16:29,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:16:29,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:16:29,878 INFO L87 Difference]: Start difference. First operand 1283 states and 4055 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:29,920 INFO L93 Difference]: Finished difference Result 1150 states and 3339 transitions. [2021-11-03 04:16:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:16:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-03 04:16:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:29,924 INFO L225 Difference]: With dead ends: 1150 [2021-11-03 04:16:29,924 INFO L226 Difference]: Without dead ends: 871 [2021-11-03 04:16:29,925 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-11-03 04:16:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-11-03 04:16:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.8517241379310345) internal successors, (2481), 870 states have internal predecessors, (2481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2021-11-03 04:16:29,954 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 17 [2021-11-03 04:16:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:29,954 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2021-11-03 04:16:29,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2021-11-03 04:16:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 04:16:29,957 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:29,957 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:29,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:16:29,958 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 634628423, now seen corresponding path program 1 times [2021-11-03 04:16:29,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:29,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444279599] [2021-11-03 04:16:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:29,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:30,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:30,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444279599] [2021-11-03 04:16:30,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444279599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:30,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:30,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:16:30,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38721180] [2021-11-03 04:16:30,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:16:30,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:16:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:16:30,050 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:30,071 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2021-11-03 04:16:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:16:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-03 04:16:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:30,074 INFO L225 Difference]: With dead ends: 1201 [2021-11-03 04:16:30,074 INFO L226 Difference]: Without dead ends: 561 [2021-11-03 04:16:30,074 INFO L786 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 [2021-11-03 04:16:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-03 04:16:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2021-11-03 04:16:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 2.648214285714286) internal successors, (1483), 560 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2021-11-03 04:16:30,092 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2021-11-03 04:16:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:30,092 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2021-11-03 04:16:30,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2021-11-03 04:16:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 04:16:30,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:30,094 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:30,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:16:30,094 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1720530527, now seen corresponding path program 1 times [2021-11-03 04:16:30,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:30,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322808371] [2021-11-03 04:16:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:30,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:30,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:30,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322808371] [2021-11-03 04:16:30,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322808371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:30,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:30,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:16:30,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475890093] [2021-11-03 04:16:30,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:16:30,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:16:30,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:16:30,216 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:30,267 INFO L93 Difference]: Finished difference Result 479 states and 1218 transitions. [2021-11-03 04:16:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:16:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-03 04:16:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:30,270 INFO L225 Difference]: With dead ends: 479 [2021-11-03 04:16:30,270 INFO L226 Difference]: Without dead ends: 403 [2021-11-03 04:16:30,271 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-03 04:16:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 387. [2021-11-03 04:16:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 2.55699481865285) internal successors, (987), 386 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 987 transitions. [2021-11-03 04:16:30,283 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 987 transitions. Word has length 19 [2021-11-03 04:16:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:30,284 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 987 transitions. [2021-11-03 04:16:30,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 987 transitions. [2021-11-03 04:16:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 04:16:30,286 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:30,286 INFO L513 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] [2021-11-03 04:16:30,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 04:16:30,286 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1510881533, now seen corresponding path program 1 times [2021-11-03 04:16:30,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:30,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596225993] [2021-11-03 04:16:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:30,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:30,397 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:30,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596225993] [2021-11-03 04:16:30,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596225993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:30,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:30,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:16:30,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209289637] [2021-11-03 04:16:30,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:16:30,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:16:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:30,401 INFO L87 Difference]: Start difference. First operand 387 states and 987 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:30,460 INFO L93 Difference]: Finished difference Result 365 states and 942 transitions. [2021-11-03 04:16:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:16:30,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-03 04:16:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:30,463 INFO L225 Difference]: With dead ends: 365 [2021-11-03 04:16:30,464 INFO L226 Difference]: Without dead ends: 223 [2021-11-03 04:16:30,465 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:16:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-03 04:16:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2021-11-03 04:16:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.4902912621359223) internal successors, (513), 206 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 513 transitions. [2021-11-03 04:16:30,472 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 513 transitions. Word has length 22 [2021-11-03 04:16:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:30,473 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 513 transitions. [2021-11-03 04:16:30,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 513 transitions. [2021-11-03 04:16:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 04:16:30,475 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:30,476 INFO L513 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] [2021-11-03 04:16:30,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 04:16:30,476 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1718323758, now seen corresponding path program 1 times [2021-11-03 04:16:30,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:30,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433764626] [2021-11-03 04:16:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:30,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:30,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:30,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433764626] [2021-11-03 04:16:30,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433764626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:30,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:30,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:16:30,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580137182] [2021-11-03 04:16:30,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:16:30,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:16:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:30,574 INFO L87 Difference]: Start difference. First operand 207 states and 513 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:30,584 INFO L93 Difference]: Finished difference Result 275 states and 676 transitions. [2021-11-03 04:16:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:16:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-03 04:16:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:30,586 INFO L225 Difference]: With dead ends: 275 [2021-11-03 04:16:30,586 INFO L226 Difference]: Without dead ends: 91 [2021-11-03 04:16:30,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:16:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-03 04:16:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-03 04:16:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2021-11-03 04:16:30,590 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 25 [2021-11-03 04:16:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:30,590 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2021-11-03 04:16:30,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2021-11-03 04:16:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 04:16:30,593 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:30,594 INFO L513 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] [2021-11-03 04:16:30,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 04:16:30,594 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 583869732, now seen corresponding path program 2 times [2021-11-03 04:16:30,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:30,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033204267] [2021-11-03 04:16:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:30,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:16:30,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:16:30,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033204267] [2021-11-03 04:16:30,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033204267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:30,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:30,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:16:30,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694928986] [2021-11-03 04:16:30,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:16:30,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:16:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:16:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:30,835 INFO L87 Difference]: Start difference. First operand 91 states and 197 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:30,892 INFO L93 Difference]: Finished difference Result 117 states and 251 transitions. [2021-11-03 04:16:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:16:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-03 04:16:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:30,894 INFO L225 Difference]: With dead ends: 117 [2021-11-03 04:16:30,894 INFO L226 Difference]: Without dead ends: 63 [2021-11-03 04:16:30,894 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:16:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-03 04:16:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-03 04:16:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 62 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2021-11-03 04:16:30,896 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2021-11-03 04:16:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:30,896 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2021-11-03 04:16:30,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:16:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2021-11-03 04:16:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 04:16:30,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:16:30,897 INFO L513 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] [2021-11-03 04:16:30,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 04:16:30,898 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-03 04:16:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -995369118, now seen corresponding path program 3 times [2021-11-03 04:16:30,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:16:30,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481069613] [2021-11-03 04:16:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:30,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:16:30,952 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:16:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:16:31,069 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:16:31,070 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:16:31,072 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:16:31,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:16:31,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-03 04:16:31,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-03 04:16:31,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-03 04:16:31,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-11-03 04:16:31,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:16:31,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 04:16:31,077 INFO L731 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:31,082 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-03 04:16:31,082 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:16:31,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:16:31 BasicIcfg [2021-11-03 04:16:31,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:16:31,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:16:31,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:16:31,211 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:16:31,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:16:09" (3/4) ... [2021-11-03 04:16:31,213 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 04:16:31,309 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 04:16:31,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:16:31,310 INFO L168 Benchmark]: Toolchain (without parser) took 24218.98 ms. Allocated memory was 88.1 MB in the beginning and 224.4 MB in the end (delta: 136.3 MB). Free memory was 58.3 MB in the beginning and 141.1 MB in the end (delta: -82.8 MB). Peak memory consumption was 56.7 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,311 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 88.1 MB. Free memory was 56.1 MB in the beginning and 56.0 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:16:31,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.92 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 58.0 MB in the beginning and 91.1 MB in the end (delta: -33.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.70 ms. Allocated memory is still 117.4 MB. Free memory was 91.1 MB in the beginning and 91.0 MB in the end (delta: 99.6 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,312 INFO L168 Benchmark]: Boogie Preprocessor took 78.64 ms. Allocated memory is still 117.4 MB. Free memory was 91.0 MB in the beginning and 88.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,312 INFO L168 Benchmark]: RCFGBuilder took 1848.48 ms. Allocated memory is still 117.4 MB. Free memory was 88.1 MB in the beginning and 48.3 MB in the end (delta: 39.9 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,313 INFO L168 Benchmark]: TraceAbstraction took 21335.26 ms. Allocated memory was 117.4 MB in the beginning and 224.4 MB in the end (delta: 107.0 MB). Free memory was 47.8 MB in the beginning and 157.9 MB in the end (delta: -110.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,313 INFO L168 Benchmark]: Witness Printer took 98.58 ms. Allocated memory is still 224.4 MB. Free memory was 157.9 MB in the beginning and 141.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-03 04:16:31,315 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.23 ms. Allocated memory is still 88.1 MB. Free memory was 56.1 MB in the beginning and 56.0 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 738.92 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 58.0 MB in the beginning and 91.1 MB in the end (delta: -33.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.70 ms. Allocated memory is still 117.4 MB. Free memory was 91.1 MB in the beginning and 91.0 MB in the end (delta: 99.6 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.64 ms. Allocated memory is still 117.4 MB. Free memory was 91.0 MB in the beginning and 88.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1848.48 ms. Allocated memory is still 117.4 MB. Free memory was 88.1 MB in the beginning and 48.3 MB in the end (delta: 39.9 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21335.26 ms. Allocated memory was 117.4 MB in the beginning and 224.4 MB in the end (delta: 107.0 MB). Free memory was 47.8 MB in the beginning and 157.9 MB in the end (delta: -110.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 16.1 GB. * Witness Printer took 98.58 ms. Allocated memory is still 224.4 MB. Free memory was 157.9 MB in the beginning and 141.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: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2682 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 6268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, positive: 3248, positive conditional: 0, positive unconditional: 3248, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1859, positive: 1798, positive conditional: 0, positive unconditional: 1798, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1859, positive: 1778, positive conditional: 0, positive unconditional: 1778, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 662, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 527, negative conditional: 0, negative unconditional: 527, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3416, positive: 1450, positive conditional: 0, positive unconditional: 1450, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 1859, unknown conditional: 0, unknown unconditional: 1859] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L776] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 535 SDtfs, 631 SDslu, 752 SDs, 0 SdLazy, 334 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2282occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 844 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-11-03 04:16:31,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3e49610-c728-4b39-9f49-9c73b90de08c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE